Serialized Form


Package mtree

Class mtree.FoundNode extends java.lang.Object implements Serializable

serialVersionUID: 1L

Serialized Fields

n

Node n
node


path

java.util.Stack<E> path
all parents of the node n on the path to the root

Class mtree.InternalNode extends Node implements Serializable

serialVersionUID: 1L

Serialized Fields

softCapacity

long softCapacity
capacity of the node, this capacity can be exceeded


occupation

long occupation
current occupation of the node in bytes


entryList

java.util.List<E> entryList
list of all internal node entries

Class mtree.LeafNode extends Node implements Serializable

Serialized Fields

bucket

messif.buckets.LocalBucket bucket
storage for leaf objects

Class mtree.MTree extends messif.algorithms.Algorithm implements Serializable

serialVersionUID: 1L

Serialized Fields

hash

int hash

intNodeCap

long intNodeCap
maximum internal node capacity


leafCap

long leafCap
maximum leaf capacity


pivots

messif.objects.LocalAbstractObject[] pivots
fixed array of pivots


npd

int npd

nhr

int nhr

root

Node root
root of M-tree


bucketDispetcher

messif.buckets.BucketDispatcher bucketDispetcher
dispatcher of all leaf buckets


defaultBucketClass

java.lang.Class<T> defaultBucketClass
default bucket class


isAlgorithmInBucket

boolean isAlgorithmInBucket
indicates the using of M-tree algorithm in the buckets


intNodeCapInBucketAlgorithm

long intNodeCapInBucketAlgorithm
maximum internal node capacity of the tree stored in every bucket (when using of an algorithm in the buckets)


leafCapInBucketAlgorithm

long leafCapInBucketAlgorithm
maximum leaf capacity of the tree stored in every bucket (when using of an algorithm in the buckets)


objectSet

java.util.Map<K,V> objectSet
map keeps ID of every stored objecs


incManager

java.util.Map<K,V> incManager
map keeps ID of operations for incremental nearest neighbor search algorithm


insRadius

double insRadius
radius is used for multi-way insertion of the new object


maxSpanningTree

int maxSpanningTree
maximum number of objects which are selected by split method to build a minimum spanning tree


statDC

messif.statistics.StatisticCounter statDC
statistics counters


statMtreeDC

messif.statistics.StatisticCounter statMtreeDC

statNodeDC

messif.statistics.StatisticRefCounter statNodeDC

statNodeAccess

messif.statistics.StatisticCounter statNodeAccess

maxLeafRadius

double maxLeafRadius
maximum leaf radius


maxFatFactor

double maxFatFactor
maximum fat-factor of nodes with level 1


minReorganizeLeaf

int minReorganizeLeaf
minimum leafs which are selected to reorganize (identified by point-query of new inserted object)


refusedObjects

java.util.List<E> refusedObjects
set of refused objects (objects which are refused by M-tree, using by M-tree forest)

Class mtree.Node extends java.lang.Object implements Serializable

Serialized Fields

level

int level

Class mtree.NodeEntry extends java.lang.Object implements Serializable

serialVersionUID: 1L

Serialized Fields

o

messif.objects.LocalAbstractObject o
stored object


r

double r
subtree radius


ptr

Node ptr
subtree of the node


hr

NodeEntry.HREntry[] hr
HR array used for PM-tree filtering

Class mtree.NodeEntry.HREntry extends java.lang.Object implements Serializable

serialVersionUID: 1L

Serialized Fields

min

double min

max

double max

Package mtree.forest

Class mtree.forest.AbstractForest extends messif.algorithms.Algorithm implements Serializable

Serialized Fields

size

int size
number of trees in the forest


trees

MTree[] trees
trees in the forest


statDC

messif.statistics.StatisticCounter statDC
statistics counters


statMinMaxDC

messif.statistics.StatisticMinMaxCounter statMinMaxDC

Class mtree.forest.Forest extends AbstractForest implements Serializable

serialVersionUID: 1L

Class mtree.forest.Forest2 extends AbstractForest implements Serializable

serialVersionUID: 1L

Serialized Fields

insertTo

int insertTo
new object will be inserted in the forest to tree at insertTo position

Class mtree.forest.Forest3 extends AbstractForest implements Serializable

serialVersionUID: 1L

Serialized Fields

insertTo

int insertTo
new object will be inserted in the forest to tree at insertTo position

Class mtree.forest.Forest4 extends AbstractForest implements Serializable

serialVersionUID: 1L

Serialized Fields

insertTo

int insertTo
new object will be inserted in the forest to tree at insertTo position

Class mtree.forest.Forest5 extends AbstractForest implements Serializable

serialVersionUID: 1L


Package mtree.utils

Class mtree.utils.Search.IncrementalObject extends java.lang.Object implements Serializable

serialVersionUID: 1L

Serialized Fields

o

messif.objects.LocalAbstractObject o

ne

NodeEntry ne

d

double d

Class mtree.utils.Split.Edge extends java.lang.Object implements Serializable

serialVersionUID: 1L

Serialized Fields

o1

messif.objects.LocalAbstractObject o1

o2

messif.objects.LocalAbstractObject o2

d

double d