Opportunistic Data Structures for Range Queries

Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data structures require asymptotically the same amount of storage as the compressed sequence if compressed using the Lempel-Ziv algorithm. The basic structure supports range sum queries in O(log n) time. With an increase by a constant factor in the storage complexity, the query time can be improved to O(log log n + k).

• Type: Conference
• Year: 2005
• Where: COCOON
• Authors: Chung Keung Poon, Wai Keung Yiu
• Keywords: COCOON 2005, Compressed Sequence, Range Sum Queries, Structure Supports Range