Package | Description |
---|---|
org.unict.ing.pds.dhtdb.datamanager.lightBeans | |
org.unict.ing.pds.light.utils |
Modifier and Type | Method and Description |
---|---|
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
|
Modifier and Type | Method and Description |
---|---|
void |
LightSessionBeanLocal.checkTreeHeight(Label label) |
void |
LightSessionBean.checkTreeHeight(Label label)
Called to check, in run-time, the height of the tree using the length of
a Label
|
List<GenericValue> |
LookupSessionBeanLocal.lightLookupAndGetDataBucket(Label bucketLabel) |
List<GenericValue> |
LookupSessionBean.lightLookupAndGetDataBucket(Label bucketLabel)
Useful method to get all the datas referenced by the Bucket with
label bucketLabel
|
Bucket |
LookupSessionBeanLocal.lookupBucket(Label l) |
Bucket |
LookupSessionBean.lookupBucket(Label l)
Get a Bucket in the Chord network and return that one if it exists
|
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 |
---|---|
private Label |
Bucket.leafLabel |
Modifier and Type | Method and Description |
---|---|
Label |
Bucket.getLeafLabel() |
Label |
Label.leftChild()
Creates a Label that could be mapped as a Left Child in the tree
|
static Label |
Label.lowestCommonAncestor(Label... labels)
Calculates the lowestCommonAncestor between a list of Label
|
Label |
Label.namingFunction()
Apply the naming function to calculate the internal node where the Label
(Leaf) is mapped.
|
private static Label |
Label.namingFunction(BitSet bits,
int dimentions,
int len)
the real static implementation of the NamingFunction
|
static Label |
Label.namingFunction(Label label)
The static implementation of the NamingFunction for 1D-LIGHT
|
static Label |
Label.namingFunction(Label label,
int dimentions)
The static implementation of the NamingFunction for MD-LIGHT
|
Label |
Label.nextNamingFunction(int prefixLength,
int treeLength)
NextNamingFunction is used to optimize the increments in the Lookup.
|
static Label |
Label.nextNamingFunction(Label label,
int prefixLength,
int treeLength)
Γ(μ) is the set of possible prefixes of μ
Γ(μ, D) set of possibile prefixes with maximum length D
Notation: μ = label, x = prefix
Locates the first bit in the suffix of μ (with respect to x) that differs from x’s ending bit; the value
nextNamingFunction(μ, x) is then the prefix of μ, which ends up with this located bit.
|
static Label |
Label.prefix(int length,
long value)
Given the value, returns the prefix label with the specified length.
|
Label |
Label.rightChild()
Creates a Label that could be mapped as a Right Child in the tree
|
Label |
Label.toDHTKey()
get the associated Label for the bucket corresponding with this label
it is the Label of an internal node
|
Modifier and Type | Method and Description |
---|---|
static Set<Label> |
Label.branchNodesBetweenLabels(Label label,
Label region)
Among all branch nodes (i.e., the second children of the ancestors) in the local tree, there exist one or more whose
regions overlap the query range.
|
Modifier and Type | Method and Description |
---|---|
static int |
Label._lowestCommonAncestor(Label label1,
Label label2)
Calculates the lowestCommonAncestor between two of Label
|
static Set<Label> |
Label.branchNodesBetweenLabels(Label label,
Label region)
Among all branch nodes (i.e., the second children of the ancestors) in the local tree, there exist one or more whose
regions overlap the query range.
|
static Range |
Label.interval(Label label)
Dual of prefix.
|
static Label |
Label.lowestCommonAncestor(Label... labels)
Calculates the lowestCommonAncestor between a list of Label
|
static Label |
Label.namingFunction(Label label)
The static implementation of the NamingFunction for 1D-LIGHT
|
static Label |
Label.namingFunction(Label label,
int dimentions)
The static implementation of the NamingFunction for MD-LIGHT
|
static Label |
Label.nextNamingFunction(Label label,
int prefixLength,
int treeLength)
Γ(μ) is the set of possible prefixes of μ
Γ(μ, D) set of possibile prefixes with maximum length D
Notation: μ = label, x = prefix
Locates the first bit in the suffix of μ (with respect to x) that differs from x’s ending bit; the value
nextNamingFunction(μ, x) is then the prefix of μ, which ends up with this located bit.
|
void |
Bucket.setLeafLabel(Label leafLabel) |
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.