Package | Description |
---|---|
org.unict.ing.pds.dhtdb.datamanager.lightBeans |
Modifier and Type | Method and Description |
---|---|
Bucket |
LookupSessionBeanLocal.lightLabelLookup(long timestamp) |
Bucket |
LookupSessionBean.lightLabelLookup(long timestamp)
An implementation of the Algorithm 1 provided in LIGHT paper
It takes a timestamp and return the associated Bucket, if it exists,
or null
|
Bucket |
LookupSessionBeanLocal.lookupBucket(Label l) |
Bucket |
LookupSessionBean.lookupBucket(Label l)
Get a Bucket in the Chord network and return that one if it exists
|
Bucket |
LightSessionBeanLocal.splitAndPut(Bucket localBucket,
long timestamp,
GenericStat elem) |
Bucket |
LightSessionBean.splitAndPut(Bucket localBucket,
long timestamp,
GenericStat elem)
Split the distributed tree and migrates the datas in the new Bucket (s)
|
Modifier and Type | Method and Description |
---|---|
private Set<Bucket> |
QuerySessionBean.rangeQuery(Range range,
int maxLength)
Creates the Set of Bucket that could store the Records associated with the Range given (the query)
|
private Set<Bucket> |
QuerySessionBean.recursiveForward(Range initialRange,
Range range,
Label region,
Set<Bucket> subRangesSet,
int maxLength)
Recursive function that search the neighbours Bucket leaves that match with the Range of the query running
|
Modifier and Type | Method and Description |
---|---|
Bucket |
LightSessionBeanLocal.splitAndPut(Bucket localBucket,
long timestamp,
GenericStat elem) |
Bucket |
LightSessionBean.splitAndPut(Bucket localBucket,
long timestamp,
GenericStat elem)
Split the distributed tree and migrates the datas in the new Bucket (s)
|
Modifier and Type | Method and Description |
---|---|
private Set<Bucket> |
QuerySessionBean.recursiveForward(Range initialRange,
Range range,
Label region,
Set<Bucket> subRangesSet,
int maxLength)
Recursive function that search the neighbours Bucket leaves that match with the Range of the query running
|
Copyright © 2018. All rights reserved.