Skip to main content
SpringerLink
Log in

An Experimental Study of Compression Methods for Dynamic Tries

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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 modern 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. KTH, Nada, SE-100 44 Stockholm, Sweden. snilsson@nada.kth.se., SE

    S. Nilsson

  2. Nokia Networks, P.O. Box 323, FIN-00045 Nokia Group, Finland. matti.j.tikkanen@nokia.com., FI

    M. Tikkanen

Authors
  1. S. Nilsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Tikkanen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received October 29, 1998; revised December, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nilsson, S., Tikkanen, M. An Experimental Study of Compression Methods for Dynamic Tries. Algorithmica 33, 19–33 (2002). https://doi.org/10.1007/s00453-001-0102-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-001-0102-y

Search

Navigation