A Compact Radix-Trie: A Character-Cell Compressed Trie Data-Structure for Word-Lookup System
- 1 January 2022
- book chapter
- Published by Springer Nature
- p. 440-449
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Adaptive Spelling Error Checking Algorithm based on Trie Tree2016
- Tree-Combined Trie: A Compressed Data Structure for Fast IP Address LookupInternational Journal of Advanced Computer Science and Applications, 2015
- A Fast Algorithm for Frequent Itemset Mining Using Patricia* Structures2012
- A Data Structure between Trie and List for Auto CompletionCommunications in Computer and Information Science, 2012
- Priority Tries for IP Address LookupIEEE Transactions on Computers, 2010
- Burst triesACM Transactions on Information Systems, 2002
- IP-address lookup using LC-triesIEEE Journal on Selected Areas in Communications, 1999
- Fast text searching for regular expressions or automaton searching on triesJournal of the ACM, 1996
- PATRICIA—Practical Algorithm To Retrieve Information Coded in AlphanumericJournal of the ACM, 1968
- Trie memoryCommunications of the ACM, 1960