Serialized Form


Package mtree

Class mtree.InternalNode extends Node implements Serializable

serialVersionUID: 1L

Serialized Fields

softCapacity

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


occupation

long occupation
current occupation of this node in bytes


entryList

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

Class mtree.LeafNode extends Node implements Serializable

serialVersionUID: -124776407006299704L

Serialized Fields

bucket

messif.buckets.LocalBucket bucket
storage for leaf objects

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

serialVersionUID: 2L

Serialized Fields

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 the tree


bucketDispatcher

messif.buckets.BucketDispatcher bucketDispatcher
dispatcher of all leaf buckets


multiwayInsertion

boolean multiwayInsertion
indicates whether a new object is inserted by multiway algorithm


insRadius

float insRadius
radius for multiway insertion of a new object


maxSpanningTree

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


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)


incManager

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

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

serialVersionUID: -2934270893617830341L

Serialized Fields

level

int level
level of this node 0: leaf 1: last internal node n: root (n = tree height)


parentNodeEntry

NodeEntry parentNodeEntry
parent node entry (null in the case of root)

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

serialVersionUID: 1L

Serialized Fields

n

InternalNode n
node in which the node entry is stored


o

messif.objects.LocalAbstractObject o
stored object


r

float r
subtree radius


subtree

Node subtree
subtree of this node


hr

NodeEntry.HREntry[] hr
array for filtering

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

serialVersionUID: 1L

Serialized Fields

min

float min

max

float max

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

serialVersionUID: 1L

Serialized Fields

entries

mtree.SearchQueue.Entry<E>[] entries
The queue holder array


size

int size
The actual size of the queue array


Package mtree.utils

Class mtree.utils.ParentFilter extends messif.objects.PrecomputedDistancesFilter implements Serializable

serialVersionUID: 1L

Serialized Fields

parentDist

float parentDist
precomputed distance to the parent pivot

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

float d

hash

int hash