Change search
ReferencesLink to record
Permanent link

Direct link
An experimental study of compression methods for dynamic tries
KTH, Superseded Departments, Numerical Analysis and Computer Science, NADA.
2002 (English)In: Algorithmica, ISSN 0178-4617, E-ISSN 1432-0541, Vol. 33, no 1, 19-33 p.Article in journal (Refereed) Published
Abstract [en]

We study an order-preserving general purpose data structure for binary data, the LPC-trie. The structure is a compressed trie, using both level and path compression. The memory usage is similar to that of a balanced binary search tree, but the expected average depth is smaller. The LPC-trie is well suited to modem language environments with efficient memory allocation and garbage collection. We present an implementation in the Java programming language and show that the structure compares favorably with a balanced binary search tree.

Place, publisher, year, edition, pages
2002. Vol. 33, no 1, 19-33 p.
Keyword [en]
data structures, trie, LPC-trie, level compression, relaxed level compression, memory management, binary search tree, Java, efficient implementation, search-trees
URN: urn:nbn:se:kth:diva-21367DOI: 10.1007/s00453-001-0102-yISI: 000174307400003OAI: diva2:340065
QC 20100525Available from: 2010-08-10 Created: 2010-08-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Nilsson, Stefan
By organisation
Numerical Analysis and Computer Science, NADA
In the same journal

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 32 hits
ReferencesLink to record
Permanent link

Direct link