Stefan Nilsson, Matti Tikkanen  Home/Search
Context
Related
| hibase.cs.hut.fi/h...lgorithmica9810.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: hibase.cs.hut.fi/hibase/hibase (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ecient memory allocation and garbage collection. We present an implementation in the Java programming language and show that the structure compares... (Update)
Similar documents (at the sentence level):
41.1%: Implementing a Dynamic Compressed Trie - Nilsson, Tikkanen (1998) (Correct)
41.1%: 2nd Workshop on Algorithm Engineering WAE'98 - Proceedings - (ed.) (1998) (Correct)
6.4%: An Experimental Study of Compression Methods for.. - Iivonen, Nilsson, Tikkanen (1999) (Correct)
Active bibliography (related documents): More All
0.5: SEPIA Programming Environment - Meier, Kay, van Rossum, Grant (1989) (Correct)
0.5: A One-Pass Aggregation Algorithm with the Optimal Buffer.. - Lee, Whang, Moon, Song (2002) (Correct)
0.4: Faster Searching in Tries and Quadtrees - An Analysis of.. - Andersson, Nilsson (1994) (Correct)
Similar documents based on text: More All
0.6: Construction of the CDAWG for a Trie - Inenaga, Hoshino, Shinohara.. (2001) (Correct)
0.3: A Method of Compressing Trie Structures - Morimoto, Iriguchi, Aoe (1994) (Correct)
0.2: Ideal Hash Trees - Bagwell (Correct)
BibTeX entry: (Update)
@article{ nilsson02experimental,
author = "Stefan Nilsson and Matti Tikkanen",
title = "An Experimental Study of Compression Methods for Dynamic Tries",
journal = "Algorithmica",
volume = "33",
number = "1",
pages = "19-33",
year = "2002",
url = "citeseer.ist.psu.edu/349957.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1973
148 Applications of Spatial Data Structures (context) - Samet - 1989
121 Handbook of Algorithms and Data Structures (context) - Gonnet, Baeza-Yates - 1991
44 Communications of the ACM (context) - Fredkin - 1960
44 Fast address lookup for internet routers - Nilsson, Karlsson - 1998
33 Digital search trees revisited (context) - Flajolet - 1986
29 Dynamic hash tables (context) - Larson - 1988
26 the performance evaluation of extendible hashing and trie se.. (context) - Flajolet - 1983
25 Paths in a random digital tree: Limiting distributions (context) - Pittel - 1986
23 Improved behaviour of tries by adaptive branching - Andersson, Nilsson - 1993
15 Algebraic methods for trie statistics (context) - Flajolet, egnier et al. - 1985
14 Asymptotical growth of a class of random trees (context) - Pittel - 1985
13 Globally order preserving multidimensional linear hashing (context) - esz, Six et al. - 1988
12 A note on the average depth of tries (context) - Devroye - 1982
11 Faster searching in tries and quadtrees { an analysis of lev.. - Andersson, Nilsson - 1994
10 Fast search in main memory databases (context) - Analyti, Pramanik - 1992
9 Multidimensional Order Preserving Linear Hashing with Partia.. (context) - Kriegel, Seeger - 1986
8 Some further results on digital search trees (context) - Kirschenhofer, Prodinger - 1986
8 A mapping function for the directory of a multidimensional e.. (context) - Otoo - 1984
6 A combinatorial framework for map labeling - Wagner, Wol - 1998
6 Balanced multidimensional extendible hash tree (context) - Otoo - 1985
5 symmetric multikey le structure (context) - Nievergelt, Hinterberger et al. - 1984
5 Bonsai: A compact representation of trees - Darragh, Cleary et al. - 1993
4 Watson Research Center (context) - Whang, Krishnamurthy et al. - 1985
2 volume A of Handbook of Computer Science (context) - van Leeuwen, Complexity - 1990
2 Randomized binary search trees (context) - Seidel, Aragon - 1996
2 on Very Large Databases (context) - Lomet, Proc et al. - 1981
2 The buddy-tree: an ecient and robust access method for spati.. (context) - Seeger, Kriegel - 1990
2 The BANG le: a new kind of grid le (context) - Freeston - 1987
1 The EXCELL method for ecient geometric access to data (context) - Tamminen - 1981
1 An ecient implementation of trie structures (context) - Aoe, Morimoto - 1992
1 A method of compressing trie structures - Morimoto, Iriguchi et al. - 1994
1 Ecient implementation of sux trees (context) - Andersson, Nilsson - 1995
Documents on the same site (http://hibase.cs.hut.fi/hibase/hibase.html): More
Incremental Garbage Collection of an Almost Unidirectional.. - Oksanen (2000) (Correct)
Dependent Types in Databases - Mäenpää, Tikkanen (1999) (Correct)
Extensible Algebraic Datatypes Through Prototypes and Subtyping - Mäenpää, Oksanen (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC