XPath leashed

ACM Computing Surveys

Volumn 41, Issue 1, 2008, Pages

  Benedikt, Michael ^a   Koch, Christoph ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

XML; XPath

Indexed keywords

COMPLEXITY BOUNDS; XML QUERY LANGUAGE; XPATH; XPATH QUERIES;

MARKUP LANGUAGES; XML;

QUERY LANGUAGES;

EID: 66649099434     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/1456650.1456653     Document Type: Article

References (109)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
2. AFANASIEV, L., BLACKBURN, P., DIMITRIOU, I., GAIFFE, B., GORIS, E., MARX, M., AND DE RIJKE, M. 2005. PDL for ordered trees. J. Appl. Non-Classical Logics 15, 115-135.
3. AFANASIEV, L., FRANCESCHET, M., MARX, M., AND DE RIJKE, M. 2004. CTL model checking for processing simple XPath queries. In Proc. TIME. 117-124.
4. AL-KHALIFA, S. AND JAGADISH, H. V. 2002. Multi-Level operator combination in XML query processing. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), 134-141.
5. AL-KHALIFA, S., JAGADISH, H. V., PATEL, J. M., WU, Y., KOUDAS, N., AND SRIVASTAVA, D. 2002. Structural joins: A primitive for efficient XML query pattern matching. In the 18th International Conference on Data Engineering (ICDE).
6. 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), 53-64.
7. AMER-YAHIA, S., CHO, S., LAKSHMANAN, L. V., AND SRIVASTAVA, D. 2001. Minimization of tree pattern queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), 497-508.
8. BAR-YOSSEF, Z., FONTOURA, M., AND JOSIFOVSKI, V. 2005. Buffering in query evaluation over XML streams. In Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
9. BAR-YOSSEF, Z., FONTOURA, M., AND JOSIFOVSKI, V. 2007. On the memory requirements of XPath evaluation over XML streams. J. Comput. Syst. Sci. 73, 3, 391-441.
10. BARCELO, P. AND LIBKIN, L. 2005. Temporal logics over unranked trees. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS). 31-40.
11. BEAUQUIER, D. AND PIN, J.-E. 1989. Factors of words. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 63-79.
12. BENEDIKT, M., BONIFATI, A., FLESCA, S., AND VYAS, A. 2005. Verification of tree updates for optimization. In Proceedings of the 17th International Conference on Computer Aided Verification.
13. BENEDIKT, M., FAN, W., AND GEERTS, F. 2005. XPath satisfiability in the presence of DTDs. In Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
14. BENEDIKT, M., FAN, W., AND KUPER, G. 2003. Structural properties of XPath fragments. In Proceedings of the 9th International Conference on Database Theory (ICDT), 79-95.
15. BIRD, S., CHEN, Y., DAVIDSON, S., LEE, H., AND ZHENG, Y 2005. Extending XPath to support linguistic queries. In PLAN-X.
16. BÖRGER, E., GRÄDEL, E., AND GUREVICH, Y 1997. The Classical Decision Problem. Springer.
17. BRANTNER, M., HELMER, S., KANNE, C.-C., AND MOERKOTTE, G 2005. Full-Fledged algebraic XPath processing in natix. In Proceedings of the 21st IEEE International Conference on Data Engineering (ICDE).
18. BRÜGGEMANN-KLEIN, A., MURATA, M., AND WOOD, D. 2001. Regular tree and regular hedge languages over non-ranked alphabets: Version 1, April 3, 2001. Tech. Rep. HKUST-TCSC-2001-05, Hong Kong University of Science and Technology, Hong Kong SAR, China.
19. BRUNO, N., SRIVASTAVA, D., AND KOUDAS, N. 2002. Holistic twig joins: Optimal XML pattern matching. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD).
20. 20 states and beyond. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS).
21. CARME, J., NIEHREN, J., AND TOMMASI, M. 2004. Querying unranked trees with stepwise tree automata. In Rewriting Techniques and Applications.
22. CHAN, C. Y., FELBER, P., GAROFALAKIS, M. N., AND RASTOGI, R. 2000. Efficient filtering of XML documents with XPath expressions. In Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE).
23. CHEKURI, C. AND RAJARAMAN, A. 1997. Conjunctive query containment revisited. In Proceedings of the 6th International Conference on Database Theory (ICDT), 56-70.
24. CLARKE, E. M., GRUMBERG, O., AND PELED, D. 2000. Model Checking. MIT Press.
25. COURCELLE, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, vol. 2, J. van Leeuwen, ed. Elsevier Science, Chapter 5, 193-242.
26. DEUTSCH, A. AND TANNEN, V. 2001. Containment and integrity constraints for XPath. In Proceedings of the International Workshop on Knowledge Representation Meets Databases (KRDB). CEUR Workshop Proceedings 45.
27. DIAO, Y., FISHER, P., FRANKLIN, M. J., AND TO, R. 2002. YFilter: Efficient and scalable filtering of XML documents. In Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE).
28. DONER, J. 1970. Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 406-451.
29. ETESSAMI, K., VARDI, M., AND WILKE, T. 2002. First order logic with two variables and unary temporal logic. Inf. Comput. 179.
30. ETESSAMI, K. AND WILKE, T. 2000. An until hierarchy and other applications of an ehrenfeucht-fraisse game for temporal logic. Inf. Comput. 160, 88-108.
31. FAN, W., CHAN, C., AND GAROFALAKIS, M. 2004. Secure XML querying with security views. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
32. FIEBIG, T. AND MOERKOTTE, G. 2000. Evaluating queries on structure with eXtended access support relations. In Proceedings of the International Workshop on Web and Databases (WebDB).
33. FLUM, J., FRICK, M., AND GROHE, M. 2002. Query evaluation via tree-decompositions. J. ACM 49, 6, 716-752.
34. FRICK, M., GROHE, M., AND KOCH, C. 2003. Query evaluation on compressed trees. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS).
35. GEERTS, F. AND FAN, W 2005. XPath satisfiability with sibling axes. In Proceedings of the 10th International Conference on Database Programming Languages (DBPL).
36. 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), 189-202.
37. GOTTLOB, G. AND KOCH, C. 2004. Monadic datalog and the expressive power of Web information extraction languages. J. ACM 51, 1, 74-113.
38. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB), 95-106.
39. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2005. Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30, 2 (Jun.), 444-491.
40. GOTTLOB, G., KOCH, C., PICHLER, R., AND SEGOUFIN, L. 2005. The complexity of XPath query evaluation and XML typing. J. ACM 52, 2 (Mar.), 284-335.
41. GOTTLOB, G., KOCH, C., AND SCHULZ, K. U. 2004. Conjunctive queries over trees. In Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 189-200.
42. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 1999. Hypertree decompositions and tractable queries. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). 21-32.
43. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2001. The complexity of acyclic conjunctive queries. J. ACM 48,1, 431-498.
44. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64, 3, 579-627.
45. GÖTZ, M., KOCH, C., AND MARTENS, W 2007. Efficient algorithms for the tree homeomorphism problem. In Proceedings of the 11th International Symposium on Database Programming Languages (DBPL).
46. GOU, G. AND CHIRKOVA, R. 2007. Efficient algorithms for evaluating XPath over streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 269-280.
47. GRÄDEL, E., KOLAITIS, P., AND VARDI, M. 1997. On the decision problem for two-variable first-order logic. Bull. Symbol. Logic 3, 53-69.
48. 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).
49. GREENLAW, R., HOOVER, H. J., AND RUZZO, W. L. 1995. Limits to parallel computation: P-completeness theory. Oxford University Press.
50. GROHE, M., KOCH, C., AND SCHWEIKARDT, N. 2007. Tight lower bounds for query processing on streaming and external memory data. Theor. Comput. Sci. 380, 1-2, 199-217.
51. GRUST, T., VAN KEULEN, M., AND TEUBNER, J. 2003. Staircase join: Teach a relational DBMS to watch its (Axis) steps. In Proceedings of the International Conference on Very Large Databases (VLDB). 524-525.
52. GRUST, T., VAN KEULEN, M., AND TEUBNER, J. 2004. Accelerating XPath evaluation in any RDBMS. ACM Trans. Database Syst. 29, 91-131.
53. GUPTA, A. K. AND SUCIU, D. 2003. Stream processing of XPath queries with predicates. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 419-430.
54. HIDDERS, J. 2003. Satisfiability of XPath expressions. In Proceedings of the 9th International Conference on Database Programming Language (DBPL).
55. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
56. IMMERMAN, N. 1999. Descriptive Complexity. Springer Graduate Texts in Computer Science.
57. JOHNSON, D. S. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science, vol. 1, J. van Leeuwen, ed. Elsevier Science, Chapter 2, 67-161.
58. JOSIFOVSKI, V. AND FONTOURA, M. F. 2005. Querying XML streams. VLDB J. 14, 2 (Apr.), 197-210.
59. KAMP, H. 1968. Tense logic and the theory of linear order. Ph.D. thesis, University of California, Los Angeles.
60. KOCH, C. 2003. Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach. In Proceedings of the 29th International Conference on Very Large Data Bases (VLDB), 249-260.
61. KOLAITIS, P. AND VARDI, M. 2000. Conjunctive query containment and constraint satisfaction. J. Comput. Syst. Sci. 61, 2, 302-332.
62. LAKSHMANAN, L. V. S., RAMESH, G., WANG, H., AND ZHAO, Z. 2004. On testing satisfiability of tree pattern queries. In Proceedings of the 30th International Conference on Very Large Databases (VLDB), 120-131.
63. LANGE, M. AND LUTZ, C. 2005. 2-ExpTime lower bounds for propositional dynamic logics with intersection. J. Symbol. Logic 70, 4, 1072-1086.
64. LIBKIN, L. 2004. Elements of Finite Model Theory. Springer.
65. MARX, M. 2004a. Conditional XPath, the first order complete XPath dialect. In Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 13-22.
66. MARX, M. 2004b. XPath with conditional axis relations. In Proceedings of the International Conference on Extending Database Technologys (EDBT), 477-494.
67. MARX, M. 2005. First order paths in ordered trees. In Proceedings of the 10th International Conference on Database Theory (ICDT).
68. MARX, M. AND DE RIJKE, M. 2004. Semantic characterizations of XPath. In the TDM Workshop on XML Databases and Information Retrieval.
69. MAY, N., BRANTNER, M., BÖHM, A., KANNE, C.-C., AND MOERKOTTE, G 2006. Index vs. navigation in xpath evaluation. In Proceedings of the Workshop at the 4th International XML Database Symposium, 16-30.
70. MEYER, A. R. 1975. Weak monadic second order theory of successor is not elementary-recursive. In Proceedings of the Logic Colloquium. Lecture Notes in Mathematics, vol. 453. Springer, 132-154.
71. MIKLAU, G. AND SUCIU, D. 2002. Containment and equivalence for an XPath fragment. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 65-76.
72. NEUMANN, A. AND SEIDL, H. 1998. Locating matches of tree patterns in forests. In Proceedings of the 18th Conference on Foundations on Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Computer Science, vol. 1530. 134-145.
73. NEVEN, F. 2002. Automata theory for XML researchers. SIGMOD Rec. 31, 3 (Sept.).
74. NEVEN, F. AND SCHWENTICK, T. 2002. Query automata on finite trees. Theor. Comput. Sci. 275, 633-674.
75. NEVEN, F. AND SCHWENTICK, T. 2003. XPath containment in the presence of disjunction, DTDs, and variables. In Proceedings of the 9th International Conference on Database Theory (ICDT). 315-329.
76. NEVEN, F. AND VAN DEN BUSSCHE, J. 2002. Expressiveness of structured document query languages based on attribute grammars. J. ACM 49, 1 (Jan.), 56-100.
77. OLTEANU, D. 2007. SPEX: Streamed and progressive evaluation of XPath. IEEE Trans. Knowl. Data Eng. 19, 7 (Jul.).
78. OLTEANU, D., KIESLING, T., AND BRY, F. 2003. An evaluation of regular path expressions with qualifiers against XML streams. In Proceedings of the 19th International Conference on Data Engineering (ICDE). Full version in Tech. Rep. PMS-FB-2002-12, Ludwig-Maximilians-Universität München, Munich, Germany, 2002.
79. OLTEANU, D., MEUSS, H., FURCHE, T., AND BRY, F. 2002. XPath: Looking forward. In Proceedings of the EDBT Workshop on XML Data Management. Lecture Notes in Computer Science, vol. 2490. Springer, 109- 127.
80. O'NEIL, P. E., O'NEIL, E. J., PAL, S., CSERI, I., SCHALLER, G., AND WESTBURY, N. 2004. ORDPATHs: Insert-friendly XML node labels. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 903-908.
81. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley.
82. PENG, F. AND CHAWATHE, S. 2003. XPath queries on streaming data. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
83. RAMANAN, P. 2005. Evaluating an XPath query on a streaming XML document. In Proceedings of the International Conference on Management of Data (COMAD), 41-52.
84. REINHARDT, K. 2002. The complexity of translating logic to finite automata. In Automata, Logics, and Infinite Games - A Guide to Current Research, E. Grädel et al., eds. Lecture Notes in Computer Science, vol. 2500.
85. SCHWENTICK, T. 2004. XPath query containment. SIGMOD Rec. 33, 1, 101-109.
86. SCHWENTICK, T. 2007. Automata for XML - A survey. J. Comput. Syst. Sci. 73, 289-315.
87. SCHWENTICK, T., THEŔIEN, D., AND VOLLMER, H. 2001. Partially-Ordered two-way automata: A new characterization of DA. In Developments in Language Theory, 239-250.
88. SEGOUFIN, L. AND VIANU, V. 2002. Validating streaming XML documents. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
89. SHANMUGASUNDARAM, J., TUFTE, K., ZHANG, C., HE, G., DEWITT, D. J., AND NAUGHTON, J. F. 1999. Relational databases for querying XML documents: Limitations and opportunities. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB), 302-314.
90. SUDBOROUGH, I. 1977. Time and tape bounded auxiliary pushdown automata. In Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 53. Springer, 493-503.
91. SUR, G., HAMMER, J., AND SIMEON, J. 2004. An XQuery-based language for processing updates in XML. In Proceedings of the ACM SIGPLAN Workshop on Programming Language Technologies for XML (PLAN-X).
92. TATARINOV, I., VIGLAS, S. D., BEYER, K., SHANMUGASUNDARAM, J., SHEKITA, E., AND ZHANG, C. 2002. Storing and querying ordered XML using a relational database system. In Proceedings of the ACM SIGMOD International Conference on Management of Data Conference, 204-215.
93. THATCHER, J. AND WRIGHT, J. 1968. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2, 1, 57-81.
94. 2. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), 234-240.
95. VARDI, M. Y. 1982. The complexity of relational query languages. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC), 137-146.
96. VARDI, M. Y. 1995. On the complexity of bounded-variable queries. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS).
97. VARDI, M. Y. AND WOLPER, P. 1986. Automata-Theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32, 183-221.
98. VENKATESWARAN, H. 1991. Properties that characterize LOGCFL. J. Comput. Syst. Sci. 43, 380-404.
99. WADLER, P. 2000. Two semantics for XPath. http://www.research. avayalabs.com/user/wadler/.
100. WADLER, P. December 1999. Aformal semantics of patterns in XSLT. In Markup Technologies. Philadelphia. Revised version in Markup Languages, MIT Press, June 2001.
101. WEIGEL, F., SCHULZ, K. U., AND MEUSS, H. 2005. The BIRD numbering scheme for XML and tree databases-Deciding and reconstructing tree relations using efficient arithmetic operations. In Proceedings of the International XML Database Symposium (XSym), 49-67.
102. WOOD, P. T. 2001. Minimizing simple XPath expressions. In Proceedings of International Workshop on the Web and Databases (WebDB).
103. WOOD, P. T. 2003. Containment for XPath fragments under DTD constraints. In Proceedings of the 9th International Conference on Database Theory (ICDT), 300-314.
104. WORLD WIDE WEB CONSORTIUM. 1999a. XML path language (XPath) recommendation. http://www.w3c.org/ TR/xpath/.
105. WORLD WIDE WEB CONSORTIUM. 1999b. XSL transformations (XSLT). W3C recommendation version 1.0. http://www.w3.org/TR/ xslt.
106. WORLD WIDE WEB CONSORTIUM. 2001. XML schema part 0: Primer. W3C recommendation. http://www.w3c.org/XML/Schema.
107. 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/.
108. WORLD WIDE WEB CONSORTIUM. 2007. XML path language (XPath) 2.0.
109. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Data Bases (VLDB), 82-94.