Efficient algorithms for processing Xpath queries

ACM Transactions on Database Systems

Volumn 30, Issue 2, 2005, Pages 444-491

  Gottlob, Georg ^a   Koch, Christoph ^a   Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Additional Key Words and Phrases: XML; Efficient Algorithms; XPath

Indexed keywords

LINEAR-SPACE QUERY PROCESSING; LINEAR-TIME QUERY PROCESSING ALGORITHMS; QUERY EVALUATION; XPATH QUERIES;

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; LINEARIZATION; POLYNOMIALS; PROGRAM PROCESSORS; QUADRATIC PROGRAMMING; QUERY LANGUAGES;

ALGORITHMS;

EID: 23944498592     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1071610.1071614     Document Type: Review

References (29)

1. AL-KHALIFA, S., SRIVASTAVA, D., JAGADISH, H. V., KOUDAS, N., PATEL, J. M., AND WU, Y. 2002. Structural joins: A primitive for efficient XML query pattern matching. In Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE'02) (San Jose, Calif.). IEEE Computer Society Press, Los Alamitos, Calif.
2. ALTINEL, M. AND FRANKLIN, M. 2000. Efficient filtering of XML documents for selective dissemination of information. In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB'2000) (Cairo, Egypt). 53-64.
3. APACHE FOUNDATION. 2004. Xalan-Java version 2.2.D11. http://xml.apache.org/xalan-j/.
4. BAR-YOSSEF, Z., FONTOURA, M., AND JOSIFOVSKI, V. 2004. On the memory requirements of XPath evaluation over XML streams. In Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'04). ACM, New York, 177-188.
5. BRUNO, N., KOUDAS, N., AND SRIVASTAVA, D. 2002. Holistic twig joins: Optimal XML pattern matching. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD'02) (Madison, Wise.). ACM, New York.
6. CHAN, C. Y., FAN, W., FELBER, P., GAROFALAKIS, M. N., AND RASTOGI, R. 2002a. Tree pattern aggregation for scalable XML data dissemination. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02) (Hong Kong, China). 826-837.
7. CHAN, C. Y., FELBER, P., GAROFALAKIS, M. N., AND RASTOGI, R. 2002b. Efficient filtering of XML documents with XPath expressions. In Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE'02) (San Jose, Calif). IEEE Computer Society Press, Los Alamitos, Calif.
8. CLARK, J. 1999. XT - A Java implementation of XSLT. http://www.jclark.com/xml/xt.html/.
9. GOTTLOB, G. AND KOCH, C. 2002. Monadic queries over tree-structured data. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02) (Copenhagen, Denmark). IEEE Computer Society Press, Los Alamitos, Calif. 189-202.
10. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2003. The complexity of XPath query processing. In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'03) (San Diego, Calif). ACM, New York.
11. GREEN, T. J., MIKLAU, G., ONIZUKA, M., AND SUCIU, D. 2003. Processing XML streams with deterministic automata. In Proceedings of the 9th International Conference on Database Theory (ICDT'03). 173-189.
12. GRUST, T., VAN KEULEN, M., AND TEUBNER, J. 2004. Accelerating XPath location steps in any RDBMS. ACM Trans. Datab. Syst. 29, 1 (Mar.), 91-131.
13. GUPTA, A. K. AND SUCIU, D. 2003. Stream processing of XPath queries with predicates. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD'03). ACM, New York, 419-430.
14. KAY, M. 2003. Saxon version 6.5.2. http://saxon.sourceforge.net/.
15. KILPELÄINEN, P. 1992. Tree matching problems with applications to structured text databases. Ph.D. dissertation. Department of Computer Science, University of Helsinki. Report A-1992-6.
16. MICROSOFT CORPORATION. 2001. Internet Explorer IE6. http://www.microsoft.com/windows/ie/default.asp.
17. PENG, F. AND CHAWATHE, S. 2003. XPath queries on streaming data. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD'03). ACM, New York, 431-442.
18. RAMANAN, P. 2002. Efficient algorithms for minimizing tree pattern queries. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD'02) (Madison, Wise.). ACM, New York, 299-309.
19. SEGOUFIN, L. 2003. Typing and querying XML documents: Some complexity bounds. In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'03). ACM, New York, 167-178.
20. SHASHA, D., WANG, J. T. L., AND GIUGNO, R. 2002. Algorithmics and applications of tree and graph searching. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'02) (Madison, Wise.). ACM, New York, 39-52.
21. WADLER, P. 1999. A formal semantics of patterns in XSLT. In Markup Technologies. Philadelphia. Revised version in Markup Languages, MIT Press, June 2001.
22. WADLER, P. 2000. Two semantics for XPath. Draft paper available at http://www.research.avayalabs.com/user/wadler/.
23. WORLD WIDE WEB CONSORTIUM. 1998. XSL working draft http://www.w3.org/TR/1998/WD-xsl-19981216.
24. WORLD WIDE WEB CONSORTIUM. 1999. XML Path Language (XPath) Recommendation. http://www.w3c.org/TR/xpath/.
25. WORLD WIDE WEB CONSORTIUM. 2000. Extensible Markup Language (XML) 1.0 (second edition). http://www.w3.org/TR/REC-xml.
26. WORLD WIDE WEB CONSORTIUM. 2002. XQuery 1.0 and XPath 2.0 formal semantics. W3C working draft (Aug. 16th 2002). http://www.w3.org/TR/query-algebra/.
27. WORLD WIDE WEB CONSORTIUM. 2004a. DOM Specification http://www.w3c.org/DOM/.
28. WORLD WIDE WEB CONSORTIUM. 2004b. XML Path Language (XPath) 2.0, working draft. http://www.w3.org/TR/2004/WD-xpath20-20040723/.
29. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Data Bases (VLDB'81). 82-94.