Answers are grounded in this paper and cite their sources.
Key retrieval is the most basic and important technology. The trie is one of the key retrieval methods that can be retrieved without depending on the number of registered keys. The development of implementation method of a trie is indispensable for use in application fields. The double array is an excellent implementation method of a trie with high speed retrieval and compactness. However, there is room for the improvement in comparison with the implementation method given priority to memory efficiency because the size for two integer types per one node is necessary. This paper presents a novel implementation method for a trie by using the idea of the randomized algorithm. From experimental observations, it was shown that the proposal method promotes efficiency of a trade-off of memory size and the speed well.
No takes yet. Share an insight, caveat, or question.
Morita et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: