Package com.github.basking2.sdsai.dsds

The DSDS package is the Document Store Data Structure package. It contains datastructure implementations meant to be stored in large, distributed, and potentially slower accessing datastores such as Cassandra. By "slow" we mean relative to memory or local disk accesses.

All datastructures contained here typically will not protect against concurrent modification. If you have a datastore that supports MVCC, that logic should be built into the NodeStore that backs your data objects. Trasactionality should also be put in the NodeStore.

All datastructures take pain to never delete their root Node as it is expected that these datastructures will have well known names on their servers.

Interface Summary

Interface	Description
BTreeMap<K,V>

Class Summary

Class	Description
BTree<K,STOREKEY,V>	A B-Tree that uses a NodeStore object to persist Nodes and user data to blob storage.
BTreeLocation<USERKEY,STOREKEY>	A recursive reprentation of a point in an in-order traversal of a B-Tree.
BTreeSelection<USERKEY,STOREKEY>	Construct a BTreeSelection from a lower key to an upper key (lower,upper].
PagedList<STOREKEY,V>	A circularly linked list in which each list element many data elements.
PagedListLocation<STOREKEY>	This is mostly a wrapper around Node but also includes some meta information about where in the page of data represented by a Node in PagedList.