Abstract

AbstractString words are a sequence of characters. Efficient data structure needs to store a word-list in memory to reduce the space complexity. Trie-tree is a popular word lookup data structure, whose word lookup time complexity is O(l) (‘l’ is the searched-word length). Array-based trie-tree, which has linear searching time complexity, is a memory inefficient data structure, which has lots of unused character-cells. Dynamic data structure (e.g., linked-list, binary search tree) based trie-tree, compresses character-cells through word prefix sharing. This paper proposes a more character-cells compressed, space-efficient trie-tree, for word-list storing and searching which has a new empty node property (get data from another trie-node) thus reduces character-cells requirement. The proposed trie data structure needs very few numbers of character-cells. From the experimental results, we have seen that using the proposed data structure to represent any dictionary word-list, 99.95% character-cells are compressed and 99.90% trie-nodes are empty.KeywordsData structureTrieRadix-trie/PATRICIA-trieWord-lookup data structuresCharacter-cellsSpace complexity

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call