Expand description
Adaptive Radix Trees (https://db.in.tum.de/~leis/papers/ART.pdf).
This ADT represents an unordered collection of byte sequences as a tree. Like a trie, the paths down the tree correspond to byte sequences, and the membership of a byte sequence is determined by the a viable path.
Structs§
Enums§
- A mock-up of what you would store for each
ArtNode
above, when columnar. - An ART node exists in the context of a sequence of bytes, and indicates the possible options based on the next byte in the sequence.