Opportunistic data structures for range queries

Journal of Combinatorial Optimization

Volumn 11, Issue 2, 2006, Pages 145-154

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

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SEQUENCE; LEMPEL-ZIV ALGORITHM; RANGE QUERIES;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES;

DATA STRUCTURES;

EID: 33646513497     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-7122-0     Document Type: Conference Paper

References (16)

1. Bender M, Farach-Colton M (2000) The LCA problem revisited. In 4th Latin American Theoretical Informatics, volume 1776 of Lecture Notes in Computer Science, pp. 88-94, Punta del Este, Uruguay, Springer-Verlag
2. Burrows M, Wheeler DJ ( 1994) A block-sorting lossless data compression algorithms. Technical report Technical Report 124, Digital SRC Research Report Cover TM.
3. Thomas JA (1991) Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons
4. Ferragina P, Manzini G (2002) On compressing and indexing data. Technical Report TR02-02-01. Universita di Pisa
5. Geary R, Raman R, Raman V (2004) Succinct ordinal trees with level-ancestor queries. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1-10
6. Golomb SW (1966) Run-length encodings. IEEE Transaction on Information Theory 12:399-401
7. Grossi R, Vitter JS (2000) Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing. pp. 397-406
8. Hon W-K, Sadakane K, Sung W-K (2003) Succinct data structures for searchable partial sums. In International Symp. on Algorithm and Computations, volume 2906 of Lecture Notes in Computer Science, pp. 505-516. Springer-Verlag, 2003
9. Huffman DA (1952) A method for the construction of minimum-redundancy codes. In Proc. of the I.R.E. 40, pp. 1098-1101
10. Poon CK (2003) Dynamic orthogonal range queries in OLAP. Theoretical Computer Science 296(3):487-510
11. Raman R, Raman V, Rao SS (2001) Succinct dynamic data structures. In Workshop on Algorithms and Data Structures, volume 2125 of Lecture Notes in Computer Science, pp. 426-437
12. Sadakane K (2002) Succinct representation of 1cp information and improvements in the compressed suffix arrays. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 225-232
13. Sadakane K (2003) New test indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48:294-313
14. Sadakane K, Grossi R (2006) Squeezing succinct data structures into entropy bounds. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
15. Willard DE ( 1983) Log-logarithmic worst-case range queries are possible in space θ(n ). Information Processing Letters, 17:81-84
16. Ziv J, Lempel A (1978) Compression of individual sequences by variable rate coding. IEEE Transaction on Information Theory 24(5):530-536