Structuring labeled trees for optimal succinctness, and beyond

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 184-193

  Ferragina, Paolo ^a   Luccio, Fabrizio ^a   Manzini, Giovanni ^b   Muthukrishnan, S ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUGMENTED DATA STRUCTURES; LABELED TREES; PATH SORTING;

ALGORITHMS; DATA PROCESSING; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; OPTIMAL SYSTEMS; PROBLEM SOLVING; SET THEORY; XML;

TREES (MATHEMATICS);

EID: 33748626529     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.69     Document Type: Conference Paper

References (36)

1. D. Benoit, E. Demaine, J. Ian Munro, R. Raman, V. Raman, and S. Rao. Representing Trees of Higher Degree. WADS, 1999. To appear in Algorithmica.
2. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. DECTR No. 124, 1994.
3. R. Cameron. Source encoding using syntactic information source models. IEEE Transactions on Information Theory, 34(4), 843-850, 1988.
4. J. Cheney. Statistical models for term compression. IEEE DCC, 2000.
5. J. Cheney. Compressing XML with multiplexed hierarchical PPM models. IEEE DCC, 2001.
6. Y. Cohen and M.S. Landy and M. Pavel. Hierarchical coding of binary images. IEEE Trans. Pattern Analysis and Mach. Intel., 284-298, 1985.
7. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. To appear in JACM. See also IEEE FOCS, 390-398, 2000.
8. P. Ferragina and R. Giancarlo and G. Manzini and M. Sciortino. Boosting Textual Compression in Optimal Linear Time. To appear in JACM. TR 13, Univ. of Palermo, 2004.
9. See also ACM-SIAM SODA 04 and CPU 03.
10. E. Fredkin. Trie Memory. Comm. ACM 3(9), 490-499, 1960.
11. R.F. Geary and R. Raman and V. Raman. Succinct ordinal trees with level-ancestor queries. ACM-SIAM SODA, 2004.
12. R. Goldman and J. Widom. Dataguides: enabling query formulation and optimization in semi structured databases. Proc. of VLDB, 436-445, 1997.
13. R. Grossi and J. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. ACM STOC, 397-406, 2000.
14. R. Grossi, A. Gupta and J. Vitter. High-Order Entropy-Compressed Text Indexes. ACM-SIAM SODA, 841-850, 2003.
15. A. Hamou-Lhadj and T.C. Lethbridge. An efficient algorithm for detecting patterns in traces of procedure calls. Proc. WODA, 2003.
16. G. Jacobson. Space-efficient Static Trees and Graphs. FOCS 1989, 549-554. Also, thesis at CMU.
17. J. Katajainen and M. Penttonen and J. Teuhola. Syntax-directed compression of program files. Software Practice & Experience, 16(3), 269-276, 1986.
18. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. Proc. ICALP, 943-955, 2003.
19. S. R. Kosaraju. Efficient Tree Pattern Matching. IEEE FOCS, 178-183, 1989.
20. H. Liefke and D. Suciu. XMILL: An Efficient Compressor for XML Data. ACM SIGMOD, 153-164, 2000.
21. G. Manzini. An Analysis of the Burrows-Wheeler Transform. Journal of the ACM, 48(3), 407-430, 2001.
22. I. Munro and V. Raman. Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. IEEE FOCS 1997, 118-126.
23. J. I. Munro and V. Raman and S. Srinivasa Rao. Space Efficient Suffix Trees. J. Algorithms, 39(2), 205-222, 2001.
24. G. Navarro, P. Ferragina, G. Manzini, and V. Mäkinen. Succinct representation of sequences. Technical Report TR/DCC-2004-5, Dept. of Computer Science. University of Chile, 2004.
25. G.C. Necula and P. Lee. The design and implementation of a certifying compiler. ACM SIGPLAN Conf. on Programming Lang. Design and Impl., 333-344, 1998.
26. C. Nevill-Manning and I. Witten and D. Maulsby. Compression by induction on hierarchical grammars. IEEEDCC, 244-253, 1994.
27. R. Raman and V. Raman and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. ACM-SIAM SODA, 233-242, 2002.
28. J.R. Rico-Juan and J. Calera-Rubio and R.C. Carrasco. Smoothing and Compression with Stochastic fc-testable Tree Languages. Pattern Recognition, 2004.
29. F. Spitzer. Markov random fields on an infinite tree. Annals of Probability, 3(3), 387-398, 1975.
30. R. Stone. On the choice of grammar and parser for the compact analytical encoding of programs. Computer Journal, 29(4), 307-314, 1986.
31. J. Tarhio. Context coding of parse trees. IEEE DCC, 1995.
32. P. Weiner. Linear Pattern Matching Algorithms. Proc. 14th IEEE Annual Symp. on Switching and Automata Theory, 1-11, 1973.
33. I. H. Witten and A. Moffat and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers. 1999.
34. Z. Ye and T. Berger. Information measures for discrete random fields. Science Press, 1998.
35. http://www.w3.org/XML/
36. XQuery 1.0: An XML Query Language. W3C. Feb 2005. http://www.w3.org/TR/ xquery/.