Package org.neo4j.index.internal.gbptree

B+tree implementation with arbitrary key/value.

See: Description

Interface Summary

Interface	Description
GBPTree.Monitor	For monitoring GBPTree.
Header.Reader	Reads a header from a GBPTree state page during opening it.
Header.Writer	Writes a header into a GBPTree state page during GBPTree.checkpoint(org.neo4j.io.pagecache.IOLimiter).
Hit<KEY,VALUE>	Represents a hit during an GBPTree.seek(Object, Object).
Layout<KEY,VALUE>	Main point of interaction for customizing a GBPTree, how its keys and values are represented as bytes and what keys and values contains.
ValueMerger<VALUE>	Decides what to do when inserting key which already exists in index.
Writer<KEY,VALUE>	Able to merge(Object, Object, ValueMerger) and remove(Object) key/value pairs into a GBPTree.

Class Summary

Class	Description
GBPTree<KEY,VALUE>	A generation-aware B+tree (GB+Tree) implementation directly atop a PageCache with no caching in between.
GBPTree.Monitor.Adaptor	Adapter for GBPTree.Monitor.
Header	Defines interfaces and common implementations of header reader/writer for GBPTree.
IdSpace	Defines special page ids for GBPTree.
Layout.Adapter<KEY,VALUE>	Adapter for Layout, which contains convenient standard implementations of some methods.
ValueMergers	Common ValueMerger implementations.

Exception Summary

Exception	Description
MetadataMismatchException	Thrown to signal mismatches between meta data about tree and user-provided configuration.
TreeInconsistencyException	Thrown to signal inconsistencies in the tree, either between tree nodes or inside a tree node.

Package org.neo4j.index.internal.gbptree Description

B+tree implementation with arbitrary key/value. Index implementation is GBPTree, which works on a PageCache. Implementation supports single writer together with concurrent lock-free and garbage-free readers.

To create an index with a custom layout (type of key/value), implement a custom Layout.

See https://en.wikipedia.org/wiki/B%2B_tree