Querying and maintaining a compact XML storage

16th International World Wide Web Conference, WWW2007

Volumn , Issue , 2007, Pages 1073-1082

  Wong, Raymond K ^a   Lam, Franky ^a   Shui, William M ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Compact storage; Query processing; Storage optimization; XML

Indexed keywords

DATA STORAGE EQUIPMENT; DATA STRUCTURES; QUERY PROCESSING; SPACE TIME ADAPTIVE PROCESSING;

COMPACT STORAGE; STORAGE OPTIMIZATION;

XML;

EID: 35348836049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1242572.1242717     Document Type: Conference Paper

References (24)

1. Dblp bibliography. See http://www.informatik.uni-trier.de/~ley/db/.
2. Shurug Al-Khalifa, H. V. Jagadish, Nick Koudas, and Jignesh M. Patel. Structural joins: A primitive for efficient XML query pattern matching. In Proceedings of the 18th International Conference on Data Engineering (ICDE), pages 141-153. IEEE Computer Society, 2002.
3. Rolf Apweiler, Amos Bairoch, and Cathy H. Wu. Protein sequence databases. Current Opinion in Chemical Biology, 8:76-80, 2004.
4. Peter Buneman, Martin Grohe, and Christoph Koch. Path Queries on Compressed XML. In Proceedings of the 29th International Conference on Very Large Databases (VLDB), pages 141-152. Morgan Kaufmann, 2003.
5. Giorgio Busatto, Markus Lohrey, and Sebastian Maneth. Efficient memory representation of xml documents. In DBPL, 2005.
6. Yi Chen, George A. Mihaila, Rajesh Bordawekar, and Sriram Padmanabhan. L-tree: A dynamic labeling structure for ordered xml data. In Wolfgang Lindner, Marco Mesiti, Can Türker, Yannis Tzitzikas, and Athena Vakali, editors, EDBT Workshops, volume 3268 of Lecture Notes in Computer Science, pages 209-218. Springer, 2004.
7. James Cheney. XMLPPM: XML-Conscious PPM Compression. See http://www.cs.cornell.edu/People/jcheney/xmlppm/xmlppm.html.
8. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, and S. Muthukrishnan. Compressing and searching xml. data via two zips. In WWW, pages 751-760, 2006.
9. Torsten Grust, Maurice van Keulen, and Jens Teubner. Accelerating xpath evaluation in any rdbms. ACM Trans. Database Syst., 29:91-131, 2004.
10. Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy, Ajith Nagaraja Rao, Feng Tian, Stratis Vigias, Yuan Wang, Jeffrey F. Naughton, and David J. DeWitt. Mixed Mode XML Query Processing. In Proceedings of the 29th International Conference on Very Large Databases (VLDB), pages 225-236. Morgan Kaufmann, 2003.
11. Guy Jacobson. Succinct Static Data Structures. PhD thesis, Carnegie Mellon University, 1988.
12. H. V. Jagadish, S. Al-Khalifa, A. Chapman, L. V. S. Lakshmanan, A. Nierman, S. Paparizos, J. M. Patel, D. Srivastava, N. Wiwatwattana, Y. Wu, and C. Yu. TIMBER: A native XML database. VLDB Journal, 11(4):274-291, 2002.
13. Vanja Josifovski, Marcus Fontoura, and Attlila Barta. Querying XML streams. VLDB Journal, 14(2): 197-210, 2005.
14. Jyrki Katajainen and Erkki Makinen. Tree compression and optimization with applications. In International Journal of Foundations ofComputer Science (FOCS), Vol. J, 1 pages 425-447. IEEE Computer Society, 1990.
15. Quanzhong Li. and Bongki Moon. Indexing and querying XML data for regular path expressions. In Proceedings of the 27th International Conference on Very Large Databases (VLDB), pages 361-370. Morgan Kaufmann, 2001.
16. Hartmut Liefke and Dan Suciu. XMiIl: an efficient compressor for XML data. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 153-164. ACM Press, 2000.
17. Sebastian Maneth and Giorgio Busatto. Tree transducers and tree compressions. In Igor Wal.uki.ew.icz, editor, FoSSaCS, volume 2987 of Lecture Notes in Computer Science, pages 363-377. Springer, 2004.
18. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann
19. Marcinkiewicz. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19, 1993.
20. Jun-Ki Min, Myung-Jae Park, and Chin-Wan Chung. XPRESS: A Queriable Compression for XML Data. In Proceedings of the 2003 ACMSlGMOD international conference on Management of data, pages 122-133. ACM Press, 2003.
21. J. Ian Munro, Venkatesh Raman, and Adam J. Storm. Representing Dynamic Binary Trees Succinctly. In Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA), pages 529-536. SIAM, 2001.
22. Adam. Silberstein, Hao He, Ke Yi, and Jun Yang. BOXes: Efficient maintenance of order-based labeling for dynamic XML data. In the 21st International Conference on Data Engineering (ICDE), pages 285-296, 2005.
23. Pankaj M. Tolani and Jayant R. Haritsa. XGRIND: A query-friendly XML compressor. In Proceedings of the 18th International Conference on Data Engineering (ICDE), pages 225-234. IEEE Computer Society, 2002.
24. Ning Zhang, Varun Kacholia, and M. Tamer Ozsu. A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML. In Proceedings of the 20th International Conference on Data Engineering (ICDE), pages 54-65. IEEE Computer Society, 2004.