A system for compacting phonebook database

Ristov, Strahil; Lauc, Davor

doi:10.1109/iti.2003.1225338

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The LZ trie and enumerated LZ trie data structures have been proposed as a part of various static data storage and retrieval applications. Namely, compression of large text collections [35], phonebook compaction for use on PDAs [36], and indexing biological sequences [37]. The last subject is the focus of current and future research of the author.…”

Section: Related Workmentioning

confidence: 99%

LZ trie and dictionary compression

Ristov¹

2005

Softw: Pract. Exper.

View full text Add to dashboard Cite

An efficient algorithm for trie compression has already been described. Here we present its practical value and demonstrate its superiority in terms of space savings to other methods of lexicon compression. Apart from simple lexicons, a compressed trie can, with some additional processing, be used as a component in the compact representation of simple static databases. We present the potential of the algorithm in compressing natural language dictionaries.

show abstract

Section: Related Workmentioning

confidence: 99%

LZ trie and dictionary compression

Ristov¹

2005

Softw: Pract. Exper.

View full text Add to dashboard Cite

show abstract

A system for compacting phonebook database

Cited by 1 publication

References 3 publications

LZ trie and dictionary compression

LZ trie and dictionary compression

Contact Info

Product

Resources

About