Binary search on trie levels with a bloom filter for longest prefix match.

Jungwon Lee Hyesook Lim

Published in: HPSR (2014)

Keyphrases

bloom filter
data structure
binary search
join processing
space efficient
index structure
prefix tree
main memory
reservoir sampling
itemsets
tree structure
high levels
similarity join
record linkage
maximum number
frequent patterns
upper bound
high dimensional