Page History

...

Internally, the trie stores data in blocks of fixed size and utilizes several different node types corresponding to common patterns in a trie’s structure. Full description of the storage format and its operation are given in the bundled MemtableTrie.md.

The implementation also includes a generic Trie interface that provides an efficient method of traversing tries as well as merging and slicing them. The interface utilizes a “cursor” concept to drastically reduce the number of intermediate objects required for traversing and transforming deep hierarchies and can be used as a basis for improvements in Cassandra’s data presentation layers (i.e. UnfilteredPartitionIterator) and compaction. Detailed documentation is provided in the bundled Trie.md.

New or Changed Public Interfaces

...