Directly Addressable Variable-Length Codes

We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sampling method. The technique is practical and has many applications to the representation of ordered sets, sparse bitmaps, partial sums, and compressed data structures for suffix trees, arrays, and inverted indexes, to name just a few. We show experimentally that the technique offers a competitive alternative to other data structures that handle this problem.

• Type: Conference
• Year: 2009
• Where: SPIRE
• Authors: Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
• Keywords: Compressed Data Structures, Data Structures, Information Retrieval, SPIRE 2009, Symbol Reordering Technique