• DocumentCode
    1598666
  • Title

    Compressing tries for storing dictionaries

  • Author

    Purdin, Titus D M

  • Author_Institution
    Dept. of Manage. Inf. Syst., Arizona Univ., Tucson, AZ, USA
  • fYear
    1990
  • Firstpage
    336
  • Lastpage
    340
  • Abstract
    A technique for compressing static dictionaries using trie structures is described. The goal is to achieve reasonable compression of such dictionaries while preserving the ability to travel both up and down in the resulting trie. An investigation is conducted of the tradeoffs necessary to accomplish this. The utility of trie structures thus constructed is discussed
  • Keywords
    data compression; data structures; database management systems; static dictionaries; trie compression; trie structures; Dictionaries; Pressing; Thesauri; Tree data structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Applied Computing, 1990., Proceedings of the 1990 Symposium on
  • Conference_Location
    Fayetteville, AR
  • Print_ISBN
    0-8186-2031-5
  • Type

    conf

  • DOI
    10.1109/SOAC.1990.82193
  • Filename
    82193
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1598666