Algebra-based XQuery cardinality estimation

International Journal of Web Information Systems

Volumn 4, Issue 1, 2008, Pages 6-47

  Sakr, Sherif ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Algebra; Benchmarking; Database management; Extensible Markup Language

Indexed keywords

EID: 84986014498     PISSN: 17440084     EISSN: 1744092     Source Type: Journal    
DOI: 10.1108/17440080810865611     Document Type: Article

References (36)

1. Aboulnaga, A., Alameldeen, A.R. and Naughton, J.F. (2001), “Estimating the selectivity of XML path expressions for internet scale applications”, Proceedings of the 27th International Conference on Very Large Data Bases (VLDB), Roma, Italy, pp. 591-600.
2. Berleant, D. (1993), “Automatically verified reasoning with both intervals and probability density functions”, Interval Computations, Vol. 2, pp. 48-70.
3. Boag, S., Chamberlin, D., Fernández, M.F., Florescu, D., Robie, J. and Siméon, J. (2006), “XQuery 1.0: an XML query language – world wide web consortium proposed recommendation”, available at: www.w3.org/TR/xquery.
4. Böhme, T. and Rahm, E. (2001), “XMach-1: a benchmark for XML data management”, Datenbanksysteme in Büro, Technik und Wissenschaft (BTW) 9, GI-Fachtagung, London, UK, pp. 264-73.
5. Boncz, P.A. (2002), “Monet: a next-generation DBMS kernel for query-intensive applications”, PhD thesis, Universiteit van Amsterdam, Amsterdam.
6. Boncz, P.A., Grust, T., Van Keulen, M., Manegold, S., Rittinger, J. and Teubner, J. (2006), “MonetDB/XQuery: a fast XQuery processor powered by a relational engine”, Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, IL, USA, pp. 479-90.
7. Brantner, M., Helmer, S., Kanne, C-C. and Moerkotte, G. (2005), “Full-fledged algebraic XPath processing in Natix”, Proceedings of the 21st International Conference on Data Engineering (ICDE), Tokyo, Japan, pp. 705-16.
8. Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E. and Yergeau, F. (2006), “World Wide Web Consortium, Extensible Markup Language (XML) 1.0”, 4th ed., available at: www.w3.org/TR/xml.
9. Chen, Z., Jagadish, H.V., Lakshmanan, L.V.S. and Paparizos, S. (2003), “From tree patterns to generalized tree patterns: on efficient evaluation of XQuery”, Proceedings of the 29th International Conference on Very Large Data Bases (VLDB), Berlin, Germany, pp. 237-48.
10. Fernández, M.F., Malhotra, A., Marsh, J., Nagy, M. and Walsh, N. (2006), “XQuery 1.0 and XPath 2.0 data model (XDM) – world wide web consortium proposed recommendation”, available at: www.w3.org/TR/xpath-datamodel.
11. Fisher, D. and Maneth, S. (2007), “Structural selectivity estimation for XML documents”, Proceedings of the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey.
12. Freire, J., Haritsa, J.R., Ramanath, M., Roy, P. and Siméon, J. (2002), “StatiX: making XML count”, Proceedings of the ACM SIGMOD International Conference on Management of Data, Madison, WI, USA, pp. 181-91.
13. Goldman, R. and Widom, J. (1997), “DataGuides: enabling query formulation and optimization in semistructured databases”, Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), Athens, Greece, pp. 436-45.
14. Grust, T. (2002), “Accelerating XPath location steps”, Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, WI, USA, pp. 109-20.
15. Grust, T. (2005), “Purely relational FLWORs”, Proceedings of the 2nd International Workshop on XQuery Implementation, Experience and Perspectives (XIME-P), in Cooperation with ACM SIGMOD, Baltimore, MD, USA.
16. Grust, T., Sakr, S. and Teubner, J. (2004), “XQuery on SQL hosts”, Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), Toronto, Canada, pp. 252-63.
17. Grust, T., Mayr, M., Rittinger, J., Sakr, S. and Teubner, J. (2007), “A SQL: 1999 code generator for the Pathfinder XQuery compiler”, Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China.
18. Ioannidis, Y.E. (1993), “Universality of serial histograms”, Proceedings of the 19th International Conference on Very Large Data Bases (VLDB), San Francisco, CA, USA, pp. 256-67.
19. Jagadish, H.V., Lakshmanan, L.V.S., Srivastava, D. and Thompson, K. (2001), “TAX: a tree algebra for XML”, Proceedings of the 8th International Workshop of Database Programming Languages (DBPL), Frascati, Italy, pp. 149-64.
20. Li, H., Lee, M-L., Hsu, W. and Cong, G. (2006), “An estimation system for XPath expressions”, Proceedings of the 22nd International Conference on Data Engineering (ICDE), Atlanta, GA, USA, p. 54.
21. Lim, L., Wang, M., Padmanabhan, S., Vitter, J.S. and Parr, R. (2002), “XPathlearner: an on-line self-tuning Markov histogram for XML path selectivity estimation”, Proceedings of the 28th International Conference on Very Large Data Bases (VLDB), Hong Kong, China, pp. 442-53.
22. Nicola, M., Kogan, I. and Schiefer, B. (2007), “An XML transaction processing benchmark”, Proceedings of the ACM SIGMOD International Conference on Management of Data, New York, NY, USA, pp. 937-48.
23. Paparizos, S., Al-Khalifa, S., Jagadish, H., Niermann, A. and Wu, Y. (2002), A Physical Algebra for XML, Technical Report, University of Michigan, Dearborn, MI.
24. Poosala, V., Ioannidis, Y.E., Haas, P.J. and Shekita, E.J. (1996), “Improved histograms for selectivity estimation of range predicates”, Proceedings of the ACM SIGMOD International Conference on Management of Data, Quebec, pp. 294-305.
25. Re, C., Siméon, J. and Fernández, M.F. (2006), “A complete and efficient algebraic compiler for XQuery”, Proceedings of the 22nd International Conference on Data Engineering (ICDE), Atlanta, GA, USA, p. 14.
26. Rittinger, J. (2005), “Pathfinder/MonetDB: a relational runtime for XQuery”, Master's thesis, Konstanz University, Konstanz.
27. Sakr, S. (2007), “Cardinality-aware and purely relational implementation of an XQuery processor”, PhD thesis, University of Konstanz, Konstanz, available at: www.ub.uni-konstanz.de/kops/volltexte/2007/3259.
28. Sartiani, C. (2003), “A general framework for estimating XML query cardinality”, Proceedings of the 9th International Database Programming Languages Workshop (DBPL), Potsdam, Germany, pp. 257-77.
29. Sartiani, C. and Albano, A. (2002), “Yet another query algebra for XML data”, Proceedings of the International Database Engineering & Applications Symposium (IDEAS), Edmonton, Canada, pp. 106-15.
30. Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I. and Busse, R. (2002), “XMark: a benchmark for XML data management”, Proceedings of the 28th International Conference on Very Large Data Bases (VLDB), Hong Kong, China, pp. 974-85.
31. Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A. and Price, T.G. (1979), “Access path selection in a relational database management system”, Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, MA, USA, pp. 23-34.
32. Teubner, J. (2006), “Pathfinder: XQuery compilation techniques for relational database targets”, PhD thesis, Technical University of Munich, Munich.
33. Wang, W., Jiang, H., Lu, H. and Yu, J.X. (2004), “Bloom histogram: path selectivity estimation for XML data with updates”, Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), Toronto, Canada, pp. 240-51.
34. Yao, B.B., Özsu, M.T. and Keenleyside, J. (2003), “XBench – a family of benchmarks for XML DBMSs”, Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers, London, UK, pp. 162-4.
35. Zhang, H. and Tompa, F.W. (2003), “XQuery rewriting at the algebraic level”, Trends in XML Technology for the Global Information Infrastructure, a special issue of Journal of Computer Systems, Science, and Engineering, Vol. 18 No. 5, pp. 241-62.
36. Zhang, N., Özsu, M.T., Aboulnaga, A. and Ilyas, I.F. (2006), “XSeed: accurate and fast cardinality estimation for XPath queries”, Proceedings of the 22nd International Conference on Data Engineering (ICDE), Atlanta, GA, USA, p. 61.