Practical entropy-compressed rank/select dictionary

Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2007, Pages 60-70

  Okanohara, Daisuke ^a   Sadakane, Kunihiko ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; NUMBER THEORY; QUERY PROCESSING; REAL TIME SYSTEMS;

ASYMPTOTIC BEHAVIOR; RANK/SELECT DICTIONARIES;

DATA STRUCTURES;

EID: 34547954080     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972870.6     Document Type: Conference Paper

References (27)

1. D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Representing trees of higher degree. Algorithmica, 43(4):275-292, 2005.
2. Y. T. Chiang, C. C. Lin, and H. I. Lu. Orderly spanning trees with applications. SIAM Journal on Computing, 34(4):924-945, 2005.
3. T. Cover. Enumerative source encoding. IEEE Trans. on Information, 19(1):73-77, 1973.
4. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In FOCS, 2005.
5. P. Ferragina and G. manzini. Indexing compressed texts. Journal of the ACM, 52(4):552-581, 2005.
6. R. Geary., N. Rahman., R. Raman., and V. Raman. A simple optimal representation for balanced parentheses. In Proc. of CPM, pages 159-172, 2004.
7. R. Geary., N. Rahman., and V. Raman. Succinct ordinal trees with level-ancestor queries. In ACM-SIAM SODA, pages 1-10, 2004.
8. A. Golynski. Optimal lower bounds for rank and select indexes. In Proc. of ICALP, 2006.
9. R. González, S. Grabowski, V. Mäkinen, and G. Navarro. Practical implementation of rank and select queries. In Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA '05), pages 27-38, Greece, 2005. CTI Press and Ellinika Grammata.
10. R. Grossi., A. Gupta., and J. Vitter. High-order entropy-compressed text indexes. In Proc. of SODA, pages 841-850, 2003.
11. R. Grossi., A. Gupta., and J. Vitter. When indexing equals compression: Experiments with compressing suffix arrays and applications. In Proc. of SODA, pages 636-645, 2004.
12. Roberto Grossi and Jeffrey Scott Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing, 35(2):378-407, 2005.
13. A. Gupta, W. Hon, R. Shar, and J. Vitter. Compressed dictionaries: Space measures, data sets, and experiments. In Proc. of WEA, 2006. To appear.
14. A. Gupta, W. K. Hon, R. Shar, and J. Vitter. Compressed data structures: Dictionaries and data-aware measures. In Proc. of DCC, pages 213-222. IEEE, 2006.
15. W. K. Hon, K. Sadakane, and W.K. Sung. Succinct data structures for searchable partial sums. In Proc. of ISAAC, pages 505-516, 2003.
16. G. Jacobson. Space-efficient static trees and graphs. In Proc. of FOCS, pages 549-554, 1989.
17. D. K. Kim., J.C. Na., J.E. Kim., and K. Park. Efficient implementation of rank and select functions for succinct representation. In Proc. of WEA, 2005.
18. P. B. Miltersen. Lower bounds on the size of selection and rank indexes. In Proc. of SODA, pages 11-12, 2005.
19. J. I. Munro. Tables. In Proc. of FSTTCS, pages 37-42, 1996.
20. J. I. Munro and S. S. Rao. Succinct representations of functions. In Proc. of ICALP, pages 1006-1015, 2004.
21. J. I. Munro, V. Rman, and S. S. Rao. Space efficient suffix trees. Journal of Algorithms, 39(2):205-222, 2001.
22. R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM J. Computation, 31(2):353-363, 2001.
23. C. K. Poon and W. K. Yiu. Opportunistic data structures for range queries. In Proc. of COCOON, pages 560-569, 2005.
24. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding kary trees and multisets. In Proc. of SODA, pages 232-242, 2002.
25. S. S. Rao. Time-space trade-offs for compressed suffix arrays. Information Processing Letters, 82(6):307-311, 2002.
26. K. Sadakane. Succinct representations of lcp informa-tion and improvements in the compressed suffi arrays. In ACM-SIAM SODA, pages 225-232, 2002.
27. K. Sadakane. New text indexing functionalities of the compressed suffix arrays. J. Algorithms, 48(2):294-313, 2003.