Summary prefix tree: An over DHT indexing data structure for efficient superset search
2017Vol. 8, pp. 1–5
Citations Over Time
Abstract
International audience
Related Papers
- → Name prefix matching using bloom filter pre-searching for content centric network(2016)42 cited
- → On reducing false positives of a bloom filter in trie-based algorithms(2014)8 cited
- → Dual-load Bloom filter: Application for name lookup(2019)17 cited
- → Binary search on trie levels with a bloom filter for longest prefix match(2014)7 cited
- → On Reducing False Positives of a Bloom Filter in Trie-Based Algorithms(2015)1 cited