Package | Description |
---|---|
org.unict.ing.pds.dhtdb.datamanager.lightBeans | |
org.unict.ing.pds.light.utils |
Modifier and Type | Method and Description |
---|---|
List<GenericValue> |
QuerySessionBean.getRangeQueryDatas(Range range)
This method can be called outside the Bean to make the query and get the Datas associated
|
List<GenericValue> |
QuerySessionBeanLocal.getRangeQueryDatas(Range range) |
Label |
LookupSessionBeanLocal.lowestCommonAncestor(Range range) |
Label |
LookupSessionBean.lowestCommonAncestor(Range range)
Get the lowest common ancestor between the Label (s) associated with
the upperBound and the lowerBound of the Range given
|
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 | Field and Description |
---|---|
static Range |
Range.EMPTY_RANGE |
private Range |
Bucket.range |
static Range |
Range.REPRESENTABLE_RANGE
The MAXIMUM RANGE of data-keys for the indexing
|
Modifier and Type | Method and Description |
---|---|
Range |
Range.createSplit(Boolean second)
Creates the Range for the left or right child of the Bucket associated with this range
|
Range |
Bucket.getRange() |
Range |
Range.intersect(Range range) |
Range |
Label.interval() |
static Range |
Label.interval(Label label)
Dual of prefix.
|
Modifier and Type | Method and Description |
---|---|
Boolean |
Range.contains(Range range) |
Range |
Range.intersect(Range range) |
Boolean |
Range.isContainedIn(Range range) |
void |
Bucket.setRange(Range range) |
Constructor and Description |
---|
Bucket(Key key,
Range range,
Label leafLabel,
int recordsCounter) |
Bucket(Range range,
Label leafLabel) |
Bucket(Range range,
Label leafLabel,
int recordsCounter) |
Copyright © 2018. All rights reserved.