Concurrent trees

In this tutorial series, I am going to talk about tries, compact tries, and suffix trees. For the sake of showing example programs I am using “Concurrent Trees” package, you can download it from https://code.google.com/p/concurrent-trees/

Concurrent-tree package provides implementations for Radix tree, Reversed Radix tree, InvertedRadix tree and suffix tree.

Below is the overview of the package.

Tree Interface	Implementation	Exact match	Key starts with	Key ends with	Key contains	Find keywords from external text
RadixTree	ConcurrentRadixTree	Yes	Yes	No	No	no
ReversedRadixTree	ConcurrentReversedRadixTree	Yes	No	Yes	No	no
InvertedRadixTree	Concurrent InvertedRadixTree	Yes	Yes	No	No	yes
SuffixTree	ConcurrentSuffixTree	Yes	No	Yes	Yes	no

Prevoius                                                 Next                                                 Home