Efficient memory representation of XML document trees

Information Systems

Volumn 33, Issue 4-5, 2008, Pages 456-474

  Busatto, Giorgio ^a   Lohrey, Markus ^b   Maneth, Sebastian ^c,d  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

^c CSIRO   (Australia)

^d UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Compression; In memory XML representation; Tree grammar

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; QUERY PROCESSING; TREES (MATHEMATICS); XML;

IN-MEMORY XML REPRESENTATION; TREE GRAMMAR;

DATA STORAGE EQUIPMENT;

EID: 43049155961     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2008.01.004     Document Type: Article

References (35)

1. Megginson D. Imperfect XML: Rants, Raves, Tips, and Tricks ... from an Insider (2004), Addison-Wesley, Reading, MA
2. Fernandez M.F., Siméon J., Choi B., Marian A., and Sur G. Implementing XQuery 1.0: the Galax experience. Proceedings of the VLDB 2003 (2003), Morgan Kaufmann, Los Altos, CA 1077-1080
3. Milo T., Suciu D., and Vianu V. Typechecking for XML transformers. J. Comput. Syst. Sci. 66 (2003) 66-97
4. Katajainen J., and Mäkinen E. Tree compression and optimization with applications. Int. J. Found. Comput. Sci. 1 (1990) 425-447
5. Ferragina P., Luccio F., Manzini G., and Muthukrishnan S. Structuring labeled trees for optimal succinctness and beyond. Proceedings of the FOCS 2005 (2005), IEEE Press, New York 184-196
6. Geary R.F., Raman R., and Raman V. Succinct ordinal trees with level-ancestor queries. Proceedings of the SODA 2004 (2004), SIAM Press, Philadelphia, PA 1-10
7. Geary R.F., Rahman N., Raman R., and Raman V. A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368 3 (2006) 231-246
8. Buneman P., Grohe M., and Koch C. Path queries on compressed XML. Proceedings of the VLDB 2003 (2003), Morgan Kaufmann, Los Altos, CA 141-152
9. Lohrey M., and Maneth S. The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363 2 (2006) 196-210
10. D.K. Fisher, S. Maneth, Structural selectivity estimation for XML documents, in: Proceedings of the ICDE 2007, IEEE Press, New York, 2007, pp. 626-635.
11. Arion A., Bonifati A., Costa G., D'Aguanno S., Manolescu I., and Pugliese A. XQueC: pushing queries to compressed XML data. Proceedings of the VLDB 2003 (2003), Morgan Kaufmann, Los Altos, CA 1065-1068
12. Liefke H., and Suciu D. XMill: an efficient compressor for XML data. Proceedings of the SIGMOD 2000 (2000), ACM Press, New York 153-164
13. S. Maneth, G. Busatto, Tree transducers and tree compressions, in: Proceedings of the FOSSACS 2004, Lecture Notes on Computer Science, vol. 2987, Springer, Berlin, 2004, pp. 363-377.
14. Lamping J. An algorithm for optimal lambda calculus reductions. Proceedings of the POPL 1990 (1990), ACM Press, New York 16-30
15. Charikar M., Lehman E., Liu D., Panigrahy R., Prabhakaran M., Sahai A., and Shelat A. The smallest grammar problem. IEEE Trans. Inform. Theory 51 7 (2005) 2554-2576
16. Plandowski W. Testing equivalence of morphisms on context-free languages. Proceedings of the ESA 1994, Lecture Notes on Computer Science vol. 855 (1994), Springer, Berlin 460-470
17. Rytter W. Algorithms on compressed strings and arrays. Proceedings of the SOFSEM 1999, Lecture Notes on Computer Science vol. 1725 (1999), Springer, Berlin 48-65
18. Gécseg F., and Steinby M. Tree languages. Handbook of Formal Languages vol. 3 (1997), Springer, Berlin (Chapter 1)
19. Yao B.B., Özsu M.T., and Khandelwal N. XBench benchmark and performance testing of XML DBMSs. Proceedings of the ECDE 2004 (2004), IEEE Press, New York 621-633
20. Murata M., Lee D., and Mani M. Taxonomy of XML schema languages using formal language theory. Proceedings of the Extreme Markup Languages (2001)
21. Bar-Hillel Y., Perles M., and Shamir E. On formal properties of simple phrase structure grammars. Z. Phonetik. Shrachwiss. Kommunikationsforsch. 14 (1961) 143-172
22. M.J. Fischer, Grammars with macro-like productions, Ph.D. Thesis, Harvard University, Massachusetts, May 1968.
23. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley, New York
24. Yamagata K., Uchida T., Shoudai T., and Nakamura Y. An effective grammar-based compression algorithm for tree structured data. Proceedings of the ILP 2003, Lecture Notes on Computer Science vol. 2835 (2003), Springer, Berlin 383-400
25. Min J., Park M., and Chung C. XPRESS: a queriable compression for XML data. Proceedings of the SIGMOD 2003 (2003), ACM Press, New York 122-133
26. Tolani P.M., and Hartisa J.R. XGRIND: a query-friendly XML compressor. Proceedings of the ICDE 2002 (2002), IEEE Press, New York 225-234
27. Zhang N., Kacholia V., and Özsu M.T. A succinct physical storage scheme for efficient evaluation of path queries in XML. Proceedings of the ICDE 2004 (2004), IEEE Press, New York 54-65
28. Cheng J., and Ng W. XQzip: querying compressed XML using structural indexing. Proceedings of the EDBT 2004, Lecture Notes on Computer Science vol. 2992 (2004), Springer, Berlin 219-236
29. Rytter W. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302 (2002) 211-222
30. J.R. Cheney, Personal communication, 2004.
31. Chen S., and Reif J.H. Efficient lossless compression of trees and graphs. Proceedings of the DCC'96 (1996), IEEE Press, New York
32. J.R. Cheney, First-order term compression: techniques and applications, Master's Thesis, Carnegie Mellon University, August 1998.
33. Frick M., Grohe M., and Koch C. Query evaluation on compressed trees (extended abstract). Proceedings of the LICS 2003 (2003), IEEE Press, New York 188-197
34. Buneman P., Choi B., Fan W., Hutchison R., Mann R., and Viglas S. Vectorizing and querying large XML repositories. Proceedings of the ICDE 2005 (2005), IEEE Press, New York 261-272
35. Gapeyev V., Levin M.Y., Pierce B.C., and Schmitt A. XML goes native: run-time representations for Xtatic. Proceedings of the CC 2005, Lecture Notes on Computer Science vol. 3443 (2005), Springer, Berlin 43-58