The Persistent Adaptive Radix Tree (PART) is a trie with a high branching factor and adaptively-sized nodes based on ART. It provides efficient persistence using path copying and reference counting. In microbenchmarks, PART achieves throughput and space efficiency comparable to a mutable hash table while providing persistence, lower variance in operation latency, and efficient union, intersection, and range scan operations.
This repository contains a Java implementation of PART based on libart.
Add the dependency to your SBT project by adding the following to build.sbt:
resolvers += "Repo at github.com/ankurdave/maven-repo" at "https://github.com/ankurdave/maven-repo/raw/master"
libraryDependencies += "com.ankurdave" %% "part" % "0.1"