This Article 
 Bibliographic References 
 Add to: 
Time-Space Trade-Off Analysis of Morphic Trie Images
November/December 2001 (vol. 13 no. 6)
pp. 1028-1032

Abstract—In this paper, we explore the use of tries to represent tries. A morphic trie image is a trie that represents a set of transformed keywords using an isomorphism h: \Sigma^* \rightarrow (\sigma^q)^*. Morphic trie images using tenary alphabets achieve near optimal performances but approximation errors degrade their performances. A condition which determines whether tenary or bit tries should be used is found. Even though bit tries have better storage reduction in some cases, tenary tries access faster than bit tries. We show that the morphic trie images use less space than minimal prefix tries. If morphic trie images were compressed to form minimal prefix tries, then the total storage reduction is the product of the two. Approximation errors have no effect on minimal prefix tries.

[1] E. Fredkin, “Trie Memory,” Comm. ACM, vol. 3, no. 9, pp. 490-500, 1960.
[2] R.J. Enbody and H.C. Du, “Dynamic Hashing Schemes,” ACM Computing Surveys, vol. 20, no. 2, pp. 85-113, June 1988.
[3] J. Aoe and M. Fujikawa, “An Efficient Representation of Hierarchical Semantic Primitives—An Aid to Machine Translation Systems,” Proc. Second Int'l Conf. Supercomputing, pp. 361-370, 1987.
[4] A.V. Aho and M.J. Corasick, “Efficient String Matching: An Aid to Bibliographic Search,” Comm. ACM, vol. 18, pp. 333-340, June 1979.
[5] E. Ukkonen and D. Wood, “Approximate String Matching with Suffix Automata,” Algorithmica, vol. 10, pp. 353-364, 1993.
[6] H. Shang and T.H. Merrettal, “Tries for Approximate String Matching,” IEEE Trans. Knowledge and Data Eng., vol. 8, no. 4, pp. 540-547, Aug. 1996.
[7] D. Ron, Y. Singer, and N. Tishby, “The Power of Amnesia,” Advances in Neural Information Processing System, vol. 6, 1993.
[8] A. Blumer, J. Blumer, D. Haussler, and R. Mcconnel, "Complete Inverted Files for Efficient Text Retrieval and Analysis," J. ACM, vol. 34, no. 3, pp. 578-595, 1987.
[9] R.E. Tarjan and A.C. Yao, "Storing a Sparse Table," Comm. ACM, vol. 22, no. 11, pp. 606-611, 1979.
[10] K. Maly, "Compressed Tries," Comm. ACM, vol. 19, no. 7, pp. 409-415, 1976.
[11] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[12] Int'l Organization for Standardization, Information Technology—Universal Multiple-Octed Coded Character Set (UCS)—Part 1: Architecture and Basic MultilinguaI Plane, ISO/IEC10646-1:1993, 1993.
[13] “The Unicode Consortium,” The Unicode Standard, Worldwide Character Encoding. Addison-Wesley, 1996.
[14] “Chinese Word Class Analysis,” Technical Report 93-05, K.J. Chen and C.R. Huang, eds., Chinese Knowledge Information Processing Group, Inst. of Information Science, Academia Sinica, Taiwan, 1993.
[15] J. Guo and H.C. Liu, “A Chinese Corpus for Pinyin-Hanzi Transcription,” ISS Technical Report TR93-112-0, Inst. of Systems Science, Nat'l Univ. of Singapore 1992
[16] A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms.Reading, Mass: Addison-Wesley, 1983.
[17] J.A. Dundas, "Implementing Dynamic Minimal-Prefix Tries," Software Practices and Experiences, vol. 21, no. 10, pp. 1,027-1,040, 1991.

R.W.P. Luk, "Time-Space Trade-Off Analysis of Morphic Trie Images," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 6, pp. 1028-1032, Nov.-Dec. 2001, doi:10.1109/69.971194
Usage of this product signifies your acceptance of the Terms of Use.