Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

PREPRINT. In Proc. 2nd Annual European Symposium onAlgorithms, pages 8293. Springer Verlag, 1994.

Summary: PREPRINT. In Proc. 2nd Annual European Symposium
onAlgorithms, pages 82­93. Springer Verlag, 1994.
Faster Searching in Tries and Quadtrees---
An Analysis of Level Compression \Lambda
Arne Andersson Stefan Nilsson
Department of Computer Science, Lund University,
Box 118, S­221 00 Lund, Sweden
We analyze the behavior of the level­compressed trie, LC­trie, a compact
version of the standard trie data structure. Based on this analysis, we argue
that level compression improves the performance of both tries and quadtrees
considerably in many practical situations. In particular, we show that LC­tries
can be of great use for string searching in compressed text.
Both tries and quadtrees are extensively used and much effort has been
spent obtaining detailed analyses. Since the LC­trie performs significantly
better than standard tries, for a large class of common distributions, while
still being easy to implement, we believe that the LC­trie is a strong candidate
for inclusion in the standard repertoire of basic data structures.
1 Introduction
A fundamental, well known, and very well studied technique for storing and retriev­


Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet


Collections: Computer Technologies and Information Sciences