Package com.orientechnologies.orient.core.storage.index.sbtreebonsai.local

Interface OSBTreeBonsai<K,V>

All Superinterfaces:

OTreeInternal<K,V>

All Known Implementing Classes:

BTreeBonsaiGlobal, OSBTreeBonsaiLocal

public interface OSBTreeBonsai<K,V>
extends OTreeInternal<K,V>

The tree that have similar structure to OSBTreeV1 and designed to store small entries.

The tree algorithm is the same as in OSBTreeV1, but it have tiny buckets.
The OReadCache could contain several buckets. That's why there is no huge resource consuming when you have lots of OSBTreeBonsai that contain only few records.

+--------------------------------------------------------------------------------------------+
| DISK CACHE PAGE |
|+---------------+ +---------------+ +---------------+ +---------------+ +---------------+ |
|| Bonsai Bucket | | Bonsai Bucket | | Bonsai Bucket | | Bonsai Bucket | | Bonsai Bucket |...|
|+---------------+ +---------------+ +---------------+ +---------------+ +---------------+ |
+--------------------------------------------------------------------------------------------+


Since:

1.7rc1

Author:

Artem Orobets (enisher-at-gmail.com)

Nested Class Summary

Nested classes/interfaces inherited from interface com.orientechnologies.orient.core.storage.index.sbtree.OTreeInternal

OTreeInternal.AccumulativeListener<K,V>, OTreeInternal.RangeResultListener<K,V>

Method Summary

Modifier and Type	Method	Description
void	clear(OAtomicOperation atomicOperation)	Deletes all entries from tree.
void	delete(OAtomicOperation atomicOperation)	Deletes whole tree.
K	firstKey()
V	get(K key)	Search for entry with specific key and return its value.
OBonsaiCollectionPointer	getCollectionPointer()
long	getFileId()	Gets id of file where this bonsai tree is stored.
OBinarySerializer<K>	getKeySerializer()
int	getRealBagSize(Map<K,Change> changes)	Hardcoded method for Bag to avoid creation of extra layer.
OBonsaiBucketPointer	getRootBucketPointer()
Collection<V>	getValuesBetween(K keyFrom, boolean fromInclusive, K keyTo, boolean toInclusive, int maxValuesToFetch)
OBinarySerializer<V>	getValueSerializer()
Collection<V>	getValuesMajor(K key, boolean inclusive, int maxValuesToFetch)
Collection<V>	getValuesMinor(K key, boolean inclusive, int maxValuesToFetch)
boolean	isEmpty()
K	lastKey()
void	loadEntriesBetween(K keyFrom, boolean fromInclusive, K keyTo, boolean toInclusive, OTreeInternal.RangeResultListener<K,V> listener)
void	loadEntriesMajor(K key, boolean inclusive, boolean ascSortOrder, OTreeInternal.RangeResultListener<K,V> listener)
void	loadEntriesMinor(K key, boolean inclusive, OTreeInternal.RangeResultListener<K,V> listener)
boolean	put(OAtomicOperation atomicOperation, K key, V value)
V	remove(OAtomicOperation atomicOperation, K key)

Method Details

getFileId

long getFileId()

Gets id of file where this bonsai tree is stored.

Returns:

id of file in OReadCache

getRootBucketPointer

OBonsaiBucketPointer getRootBucketPointer()

Returns:

the pointer to the root bucket in tree.

getCollectionPointer

OBonsaiCollectionPointer getCollectionPointer()

Returns:

pointer to a collection.

get

V get(K key)

Search for entry with specific key and return its value.

Parameters:

key -

Returns:

value associated with given key, NULL if no value is associated.

put

boolean put(OAtomicOperation atomicOperation,
 K key,
 V value)
     throws IOException

Throws:

IOException

clear

void clear(OAtomicOperation atomicOperation)
    throws IOException

Deletes all entries from tree.

Parameters:

atomicOperation -

Throws:

IOException

delete

void delete(OAtomicOperation atomicOperation)

Deletes whole tree. After this operation tree is no longer usable.

Parameters:

atomicOperation -

isEmpty

boolean isEmpty()

Specified by:

isEmpty in interface OTreeInternal<K,V>

remove

V remove(OAtomicOperation atomicOperation,
 K key)
  throws IOException

Specified by:

remove in interface OTreeInternal<K,V>

Throws:

IOException

getValuesMinor

Collection<V> getValuesMinor(K key,
 boolean inclusive,
 int maxValuesToFetch)

loadEntriesMinor

void loadEntriesMinor(K key,
 boolean inclusive,
 OTreeInternal.RangeResultListener<K,V> listener)

getValuesMajor

Collection<V> getValuesMajor(K key,
 boolean inclusive,
 int maxValuesToFetch)

loadEntriesMajor

void loadEntriesMajor(K key,
 boolean inclusive,
 boolean ascSortOrder,
 OTreeInternal.RangeResultListener<K,V> listener)

Specified by:

loadEntriesMajor in interface OTreeInternal<K,V>

getValuesBetween

Collection<V> getValuesBetween(K keyFrom,
 boolean fromInclusive,
 K keyTo,
 boolean toInclusive,
 int maxValuesToFetch)

firstKey

K firstKey()

Specified by:

firstKey in interface OTreeInternal<K,V>

lastKey

K lastKey()

loadEntriesBetween

void loadEntriesBetween(K keyFrom,
 boolean fromInclusive,
 K keyTo,
 boolean toInclusive,
 OTreeInternal.RangeResultListener<K,V> listener)

getRealBagSize

int getRealBagSize(Map<K,Change> changes)

Hardcoded method for Bag to avoid creation of extra layer.

Don't make any changes to tree.

Parameters:

changes - Bag changes

Returns:

real bag size

getKeySerializer

OBinarySerializer<K> getKeySerializer()

getValueSerializer

OBinarySerializer<V> getValueSerializer()