XQueC: A query-conscious compressed XML database

ACM Transactions on Internet Technology

Volumn 7, Issue 2, 2007, Pages

  Arion, Andrei ^a   Bonifati, Angela ^b,d   Manolescu, Ioana ^a   Pugliese, Andrea ^c  

^a INRIA   (France)

^b ICAR CNR   (Italy)

^c UNIVERSITY OF CALABRIA   (Italy)

^d ICAR CNR   (Italy)

Author keywords

XML compression; XML data management; XML databases; XQuery

Indexed keywords

DATA COMPRESSION; DATA STRUCTURES; ELECTRONIC DATA INTERCHANGE; INFORMATION MANAGEMENT; MATHEMATICAL MODELS; QUERY PROCESSING; RELATIONAL DATABASE SYSTEMS;

COMPRESSION RATIOS; DATA ARCHIVING; QUERY PROCESSORS; VERBOSE REPRESENTATION;

XML;

EID: 34250195749     PISSN: 15335399     EISSN: 15576051     Source Type: Journal    
DOI: 10.1145/1239971.1239974     Document Type: Article

References (53)

1. AL-KHALIFA, S., JAGADISH, H., PATEL, J., WU, Y., KOUDAS, N., AND SRIVASTAVA, D. 2002. Structural joins: A primitive for efficient XML query pattern matching. In Proceedings of the 18th International Conference on Data Engineering. IEEE, 141-152.
2. AMEE-YAHIA, S. AND JOHNSON, T. 2000. Optimizing queries on compressed bitmaps. In Proceedings of 26th International Conference on Very Large Data Bases. ACM, 329-338.
3. ANTOSHENKOV, G. 1997. Dictionary-based order-preserving string compression. VLDB J. 6, 1, 26-39.
4. ANTOSHENKOV, G., LOMET, D., AND MURRAY, J. 1996. Order preserving string compression. In Proceedings of the 12th International Conference on Data Engineering. IEEE, 655-663.
5. APA 2004. Apache custom log format. http://www.apache.org/docs/mod/ mod_log_config.html.
6. ARION, A., BENZAKEN, V., MANOLESCU, I., PAPAKONSTANTINOU, Y., AND VIJAY, R. 2006. Algebra-based identification of tree patterns in XQuery. In Proceedings of the International Conference on Flexible Query Answering Systems. 13-25.
7. ARION, A., BONIFATI, A., COSTA, G., D'AGUANNO, S., MANOLESCU, I., AND PUGLIESE, A. 2004. Efficient query evaluation over compressed XML data. In Proceedings of the International Conference on Extending Database Technologies. Heraklion, Grece, 200-218.
8. ARION, A., BONIFATI, A., MANOLESCU, I., AND PUGLIESE, A. 2006. Path summaries and path partitioning in modern XML databases. In Proceedings of the International World Wide Web Conference, 1077-1078.
9. BER 2003. Berkeley DB Data Store, http://www.sleepycat.com/products/data. shtml.
10. BOHANNON, P., FREIRE, J., ROY, P., AND SIMEON, J. 2002. From XML schema to relations: A cost-based approach to XML storage. In Proceedings of the 18th International Conference on Data Engineering. IEEE, 64-76.
11. BUNEMAN, P., GROHE, M., AND KOCH, C. 2003. Path queries on compressed XML. In Proceedings of 29th International Conference on Very Large Data Bases. Morgan Kaufmann, 141-152.
12. BUSATTO, G., LOHREY, M., AND MANETH, S. 2005. Efficient memory representation of XML documents. In Proceedings of the 10th International Symposium on Database Programming Languages. Trondheim, Norway, 199-216.
13. BZIP2 2002. The bzip2 and libbzip2 Official Home Page, http://sources.redhat.com/bzip2/.
14. CHEN, Z., GEHRKE, J., AND KORN, F. 2000. Query optimization in compressed database systems. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM, 271-282.
15. CHEN, Z., JAGADISH, H., LAKSHMANAN, L., AND PAPARIZOS, S. 2003. From tree patterns to generalized tree patterns: On efficient evaluation of XQuery. In Proceedings of 29th International Conference on Very Large Data Bases. Morgan Kaufmann, 237-248.
16. CHENEY, J. 2001. Compressing XML with multiplexed hierarchical PPM models. In Data Compression Conference. IEEE Computer Society, 163-172.
17. CHENEY, J. 2005. An empirical evaluation of simple DTD-conscious compression techniques. In WebDB. 43-48.
18. CHENG, J. AND NG, W. 2004. XQzip: Querying compressed XML using structural indexing. In Proceedings of the International Conference on Extending Database Technologies. Heraklion, Greece, 219-236.
19. FIEBIG, T., HELMER, S., KANNE, C., MOERKOTTE, G., NEUMANN, J., SCHIELE, R., AND WESTMANN, T. 2002. Anatomy of a native XML base management system. VLDB J. 11, 4, 292-314.
20. GALAX 2006. Galax: An implementation of XQuery. Available at www.galaxquery.org.
21. GOLDMAN, R. AND WIDOM, J. 1997. DataGuides: Enabling query formulation and optimization in semistructured databases. In Proceedings of 23rd International Conference on Very Large Data Bases. Morgan Kaufman, 436-445.
22. GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1998. Compressing relations and indexes. In Proceedings of the 14th International Conference on Data Engineering. IEEE, 370-379.
23. GRAEFE, G. 1993. Query evaluation techniques for large databases. ACM Compu. Surv. 25, 2, 73-170.
24. GREER, R. 1999. Daytona and the fourth-generation language Cymbal. In Proceedings ACM SIGMOD International Conference on Management of Data. ACM, 525-526.
25. GRUST, T. 2002. Accelerating XPath location steps. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data. ACM, 109-120.
26. HALVERSON, A., BURGER, J., GALANIS, L., KINI, A., KRISHNAMUHTHY, R., RAO, A., TIAN, P., VIGLAS, S., WANG, Y., NAUGHTON, J., AND DEWITT, D. 2003. Mixed mode XML query processing. In Proceedings of 29th International Conference on Very Large Data Bases, Morgan Kaufmann, 225-236.
27. HU, T. C. AND TUCKER, A. C. 1971. Optimal computer search trees and variable-length alphabetical codes. SIAM J. of App. Mathe. 21, 4, 514-532.
28. HUFFMAN, D. A. 1952. A method for construction of minimum-redundancy codes. In Proceedings of the IRE. 1098-1101.
29. IBIBLIO 2004. Ibiblio.org web site. Available at www.ibiblio.org/xml/ books/biblegold/examples/baseball/.
30. INEX 2004. INitative for the Evaluation of XML retrieval, inex.is.informatik.uni-duisburg.de: 2004.
31. JAGADISH, H. V., AL-KHALIFA, S., CHAPMAN, A., LAKSHMANAN, L. V., NIERMAN, A., PAPARIZOS, S., PATEL, J., SRIVASTAVA, D., WIWATWATTANA, N., WU, Y., AND YU., C. 2002. Timber: A native XML database. VLDB J. 11, 4, 274-291.
32. JAGADISH, H. V., NG, R., OOI, B. C., AND TUNG, A. K. H. 2004. ItCompress: An iterative semantic compression algorithm. In Proceedings of the International Conference on Data Engineering. IEEE Computer Society, 646-658.
33. JAIN, A. K., MURTY, M. N., AND FLYNN, P. J. 1999. Data clustering: A review. ACM Comput. Surv. 31, 3, 264-323.
34. LIEFKE, H. AND SUCIU, D. 2000. XMILL: An efficient compressor for XML Data. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM, 153-164.
35. MIKLAU, G. AND SUCIU, D. 2002. Containment and equivalence for an XPath fragment. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Conference on the Principles of Database Systems. 65-76.
36. MILO, T. AND SUCIIU, D. 1999. Index structures for path expressions. In Proceedings of the International Conference on Database Theory (ICDT). 277-295.
37. MIN, J. K., PARK, M., AND CHUNG, C. 2003. XPRESS: A queriable compression for XML data. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. ACM, 122-133.
38. MIN, J. K., PARK, M., AND CHUNG, C. 2006. A compressor for effective archiving, retrieval, and update of XML documents. ACM Trans. Intern. Techn. 6, 3.
39. MOFFAT, A. AND ZOBEL, J. 1992. Coding for compression in full-text retrieval systems. In Proceedings of the Data Compression Conference (DCC). 72-81.
40. MOURA, E. D., NAVARRO, G., ZIVIANI, N., AND BAEZA-YATES, R. 2000. Fast and flexible word searching on compressed text. ACM Trans. Inform. Syst. 18, 2 (April), 113-139.
41. NG, W., LAM, Y. W., AND CHENG, J. 2006. Comparative analysis of XML compression technologies. WWW J. 9, 1, 5-33.
42. NG, W., LAM, Y. W., WOOD, P., AND LEVENE, M. 2006. XCQ: A queriable XML compression system. Inter, J. Knowl, Inform, Syst. To appear.
43. PAPARIZOS, S., AL-KHALIFA, S., CHAPMAN, A., JAGADISH, H. V., LAKSHMANAN, L. V. S., NIERMAN, A., PATEL, J. M., SRIVASTAVA, D., WIWATWATTANA, N., WU, Y., AND YU, C. 2003. TIMBER: A native system for querying XML. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. ACM, 672.
44. POESS, M. AND POTAPOV, D. 2003. Data compression in Oracle. In Proceedings of 29th International Conference on Very Large Data Bases. Morgan Kaufmann, 937-947.
45. ROY, P., SESHADRI, S., SUDARSHAN, S., AND BHOBE, S. 2000. Efficient and extensible algorithms for multi query optimization. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. Dallas, TX. 249-260.
46. SCHMIDT, A., WAAS, F., KERSTEN, M., CAREY, M., MANOLESCU, I., AND BUSSE, R. 2002. XMark: A benchmark for XML data management. In Proceedings of 28th International Conference on Very Large Data Bases. Morgan Kaufmann, 974-985.
47. TOLANI, P. AND HARITSA, J. 2002. XGRIND: A Query-friendly XML Compressor. In Proceedings of the 18th International Conference on Data Engineering. IEEE, 225-235.
48. TRANSACTION PROCESSING PERFORMANCE COUNCIL. 1999. TPC-H benchmark database. http://www.tcp.org.
49. UWXML 2004. University of Washington's XML repository. Available at www.cs.washington.edu/research/xmldatasets.
50. WESTMANN, T., KOSSMANN, D., HELMER, S., AND MOERKOTTE, G. 2000. The implementation and performance of compressed databases. ACM SIGMOD Rec. 29, 3, 55-67.
51. WITTEN, I. H. 1987. Arithmetic coding For data compression. Comm. ACM, 857-865.
52. XMLZIP 1999. XMLZip XML compressor. Available at http://www.xmls.com/ products/xmlzip/xmlzip.html.
53. XQUE 2004. The XML query language. http://www.w3.org/XML7Query.