Publisher
Springer International Publishing
Reference17 articles.
1. Trie,
https://en.wikipedia.org/wiki/Trie
2. Heinz, S., Zobel, J., Williams, H.E.: Burst Tries: A Fast, Efficient Data Structure for String Keys. ACM Transactions on Information Systems 20(2), 192–223 (2002)
3. Askitis, N., Zobel, J.: B-tries for Disk-based String Management. VLDB Journal 18(1), 157–179 (2009)
4. Litwin, W.: Linear Hashing: A New Tool for File and Table Addressing. In: VLDB (1980)
5. Larson, P.A.: Dynamic Hash Tables. Communications of the ACM 31(4), 446–457 (1988)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献