Home

Overview

Tr13 implements a compact representation of basic radix-tree (aka "trie") in Java

Design/Implementation Goals

Main goal is compactness of representation to allow keeping large datasets in memory; which in itself can lead to significant performance improvements. As a practical rule-of-thumb, size of memory representation should be smaller than serialization as simple key/value data file. This is an order of magnitude better than that of standard JDK data structures (like HashMap); and is also significantly easier for GC -- data itself resides as a single byte array or ByteBuffer (in latter case possibly residing out of Java Heap altogether).

Javadocs

• 0.3.1: JavaDoc