Opportunistic data structures for range queries

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 560-569

  Poon, Chung Keung ^a   Yiu, Wai Keung ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA COMPRESSION; QUERY LANGUAGES; COMBINATORIAL MATHEMATICS; DATA STRUCTURES;

QUERIES; QUERY TIME; STORAGE COMPLEXITY; BASIC STRUCTURE; BIT INTEGERS; CONSTANT FACTORS; LEMPEL-ZIV ALGORITHMS; RANGE QUERY; SUM-QUERY;

DATA STRUCTURES; DIGITAL STORAGE;

EID: 26844554097     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_57     Document Type: Conference Paper

References (15)

1. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In STOC'99, pages 295-304, 1999.
2. M. Bender and M. Farach-Colton. The level ancestor problem simplified. In LATIN'02, LNCS 2286, pages 508-512, April 2002.
3. M. Burrows and D.J. Wheeler. A block-sorting lossless data compression algorithms. Technical Report 124, Digital SRC Research Report, 1994.
4. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, 1991.
5. Paolo Ferragina and Giovanni Manzini. On compressing and indexing data. Technical Report TR-02-01, Dipartimento di Informatica, Universita di Pisa, Jan 2002.
6. Richard Geary, Rajeev Raman, and Venkatesh Raman. Succinct ordinal trees with level-ancestor queries. In SODA '04, pages 1-10, 2004.
7. S.W. Golomb. Run-length encodings. IEEE Transaction on Information Theory, 12:399-401, 1966.
8. Roberto Grossi and Jeffrey Scott Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In STOC'00, pages 397-406, 2000.
9. Wing-Kai Hon, Kunihiko Sadakane, and Wing-Kin Sung. Succinct data structures for searchable partial sums. In ISAAC'03, LNCS 2906, pages 505-516, 2003.
10. D.A. Huffman. A method for the construction of minimum-redundancy codes. In Proc. of the I.R.E. 40, pages 1098-1101, 1952.
11. Chung Keung Poon. Dynamic orthogonal range queries in OLAP. Theoretical Computer Science, 296(3): 487-510, March 2003.
12. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct dynamic data structures. In WADS'01, LNCS 2125, pages 426-437, 2001.
13. K. Sadakane. Succinct representation of lcp information and improvements in the compressed suffix arrays. In SODA '02, pages 225-232, 2002.
14. K. Sadakane. New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms, 48:294-313, 2003.
15. J. Ziv and A. Lempel. Compression of individual sequences by variable rate coding. IEEE Transaction on Information Theory, 24(5):530-536, 1978.