Succinct trees in practice

2010 Proceedings of the 12th Workshop on Algorithm Engineering and Experiments, ALENEX 2010

Volumn , Issue , 2010, Pages 84-97

  Arroyuelo, Diego ^a   Cánovas, Rodrigo ^b   Navarro, Gonzalo ^b   Sadakane, Kunihiko ^c  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF CHILE   (Chile)

^c NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; DEGREE SEQUENCE; DEPTH FIRST; PREORDERS; SUCCINCT REPRESENTATION; TIME AND SPACE PERFORMANCE; TREE OPERATIONS; TREE REPRESENTATION;

EXPERIMENTS; PROGRAM COMPILERS;

FORESTRY;

EID: 84880338581     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. D. Arroyuelo, F. Claude, S. Maneth, V. M akinen, G. Navarro, K. Nguyen, J. Siren, and N. Valimaki. Fast in-memory XPath search over compressed text and tree indexes. In Proc. 26th ICDE, 2010. To appear.
2. M. Bender and M. Farach-Colton. The LCA problem revisited. In Proc. 4th LATIN, LNCS 1776, pages 88- 94, 2000.
3. M. Bender and M. Farach-Colton. The level ancestor problem simplified. Theoretical Computer Science, 321(1):5-12, 2004.
4. D. Benoit, E. Demaine, I. Munro, R. Raman, V. Raman, and S. Rao. Representing trees of higher degree. Algorithmica, 43(4):275-292, 2005.
5. D. Blandford, G. Blelloch, and I. Kash. An experimental analysis of a compact graph representation. In Proc. 6th ALENEX, pages 49-61, 2004.
6. F. Claude and G. Navarro. Practical rank/select queries over arbitrary sequences. In Proc. 15th SPIRE, LNCS 5280, pages 176-187, 2008.
7. O. Delpratt, N. Rahman, and R. Raman. Engineering the LOUDS succinct tree representation. In Proc. 5th WEA, pages 134-145. LNCS 4007, 2006.
8. A. Farzan and J. I. Munro. A uniform approach towards succinct representation of trees. In Proc. 11th SWAT, LNCS 5124, pages 173-184, 2008.
9. J. Fischer and V. Heun. A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In Proc. ESCAPE, LNCS 4614, pages 459-470, 2007.
10. R. Geary, N. Rahman, R. Raman, and V. Raman. A simple optimal representation for balanced parentheses. Theoretical Computer Science, 368(3):231-246, 2006.
11. R. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. In Proc. 15th SODA, pages 1-10, 2004.
12. A. Golynski, R. Grossi, A. Gupta, R. Raman, and S. Rao. On the size of succinct indices. In Proc. 15th ESA, pages 371-382. LNCS 4698, 2007.
13. R. Gonzalez, Sz. Grabowski, V. Makinen, and G. Navarro. Practical implementation of rank and select queries. In Proc. 4th WEA (posters), pages 27-38, 2005.
14. A. Gupta, W.-K. Hon, R. Shah, and J. Vitter. Compressed dictionaries: Space measures, data sets, and experiments. In Proc. 5th WEA, pages 158-169, 2006.
15. M. He, J. I. Munro, and S. S. Rao. Succinct ordinal trees based on tree covering. In Proc. 34th ICALP, LNCS 4596, pages 509-520, 2007.
16. G. Jacobson. Space-efficient static trees and graphs. In Proc. 30th FOCS, pages 549-554, 1989.
17. J. Jansson, K. Sadakane, and W.-K. Sung. Ultrasuccinct representation of ordered trees. In Proc. 18th SODA, pages 575-584, 2007.
18. H.-I. Lu and C.-C. Yeh. Balanced parentheses strike back. ACM Transactions on Algorithms (TALG), 4(3):article 28, 2008.
19. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3):762-776, 2001.
20. I. Munro, V. Raman, and S. Rao. Space efficient suffix trees. Journal of Algorithms, 39(2):205-222, 2001.
21. I. Munro and S. Rao. Succinct representations of functions. In Proc. 31th ICALP, LNCS 3142, pages 1006-1015, 2004.
22. G. Navarro. Implementing the LZ-index: Theory versus practice. ACM Journal of Experimental Algorithmics (JEA), 13(article 2), 2009. 49 pages.
23. D. Okanohara and K. Sadakane. Practical entropycompressed rank/select dictionary. In Proc. 9th ALENEX, 2007.
24. R. Raman, V. Raman, and S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th SODA, pages 233-242, 2002.
25. K. Sadakane. Compressed Suffix Trees with Full Functionality. Theory of Computing Systems, 41(4):589- 607, 2007.
26. K. Sadakane and G. Navarro. Fully-functional static and dynamic succinct trees. CoRR, abs/0905.0768, 2009. http://arxiv.org/abs/0905.0768.
27. K. Sadakane and G. Navarro. Fully-functional succinct trees. In Proc. 21st SODA, 2010. To appear.
28. A. Schmidt, F. Waas, M. Kersten, M. Carey, I. Manolescu, and R. Busse. XMark: A benchmark for XML data management. In Proc. 28th VLDB, pages 974-985, 2002.