Containment and equivalence for a fragment of XPath

Journal of the ACM

Volumn 51, Issue 1, 2004, Pages 2-45

  Miklau, Gerome ^a   Suciu, Dan ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Query containment; Query equivalence; Tree pattern matching; XPath expressions

Indexed keywords

QUERY CONTAINMENT; QUERY EQUIVALENCE; TREE PATTERN MATCHING; XPATH EXPRESSIONS;

ALGORITHMS; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PACKET SWITCHING; THEOREM PROVING; XML;

QUERY LANGUAGES;

EID: 4243187063     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/962446.962448     Document Type: Conference Paper

References (29)

1. AMER-YAHIA, S., CHO, S., LAKSHMANAN, L. V. S., AND SRIVASTAVA, D. 2001. Minimization of tree pattern queries. In Proceedings of the ACM SIGMOD, ACM, New York.
2. BUNEMAN, P., DAVIDSON, S., FAN, W., HARA, C., AND TAN, W. 2001. Keys for XML. to Proceedings of the 10th WWW Conference, pp. 201-210.
3. CAI, J., PAIGE, R., AND TARJAN, R. 1992. More efficient bottom-up multi-pattern matching in trees. Theoret. Comput. Sci. 106, 1, 21-60.
4. CALVANESE, D., DE GIACOMO, G., LENZERINI, M., AND VARDI, M. Y. 2002. View-based query answering and query containment over semistructured data. In Database Programming Languages, 8th International Workshop (DBPL 2001) (Frascati, Italy, Sept. 8-10). Lecture Notes in Computer Science, vol. 2397. Springer-Verlag, New York, pp. 40-61.
5. CHAMBERLIN, D., CLARK, J., FLORESCU, D., ROBIE, J., SIMEON, J., AND STEFANASCU, M. 2001. XQuery 1.0: An XML query language. http://www.w3.org/TR/ xquery/.W3C working draft.
6. CHANDRA, A., AND MERLIN, P. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of 9th ACM Symposium on Theory of Computing. ACM, New York, 77-90.
7. COLE, R., HARIHAN, R., AND INDYK, P. 1999. Tree pattern matching and subset matching in deterministic o(nlog3n) time. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 245-254.
8. DEROSE, S., JR., R. D., AND MALER, E. 1999. XML pointer language (XPointer) working draft. http://www.w3.org/TR/1999/WD-xptr-19991206.
9. DEROSE, S., MALER, E., AND ORCHARD, D. 2001. XML linking language (Xlink). http://www.w3.org/TR/2000/REC-xlink-20010627.
10. DEUTSCH, A. AND TANNEN, V. 2001. Containment and Integrity Constraints for XPath Fragments. In Proceedings of the 8th International Workshop on Knowledge Representation Meeting Database (KRDB) 2001 (Rome, Italy). CEUR Workshop Proceedings 45.
11. FLORESCU, D., LEVY, A., AND SUCIU, D. 1998. Query containment for conjunctive queries with regular expressions. In Proceedings on the symposium on Principles of Database Systems (PODS). ACM, New York, 139-148.
12. GAREY, M., AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, Calif.
13. 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 2002).
14. GOTTLOB, G., KOCH, C. AND PICHLER, R. 2003. Xpath query evaluation: Improving time and space efficiency. In Proceedings of the 19th International Conference on Data Engineering (ICDE 2003).
15. HOFFMANN, C., AND O'DONNELL, M. 1982. Pattern matching in trees. J. ACM 29, 1, 68-95.
16. KILPELAINEN, P., AND MANNILA, H. 1995. Ordered and unordered tree inclusion. SIAM J. Comput. 24, 2, 340-356.
17. KOSARAJU, S. R. 1989. Efficient tree pattern matching. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, Calif., 178-183.
18. MILO, T., AND SUCIU, D. 1999. Index structures for path expressions. In ICDT. 277-295.
19. NEVEN, F., AND SCHWENTICK, T. 2003. Xpath containment in the presence of disjunction, dtds, and variables. In Proceedings of the 19th International Conference on Data Engineering (ICDE 2003).
20. SHMUELI, O. 1993. Equivalence of datalog queries is undecidable. J. Logic Prog. 15, 3 (Feb.). 231-242.
21. SNOEREN, A., CONLEY, K., AND GIFFORD, D. 2001. Mesh-based content routing using XML. In Proceedings of the 18th Symposium on Operating Systems Principles.
22. STOCKMEYER, L. J., AND MEYER, A. 1973. Word problems requiring exponential time. In Proceedings of the 5th Annual ACM Symposium on Theory of Computing. ACM, New York, 1-9.
23. THORUP, M. 1996. Efficient preprocessing of simple binary pattern forests. J. Algorithms 20, 3, 602-612.
24. VARDI, M. 1997. Why is modal logic so robustly decidable. http://www.cs.rice.edu/~vardi/papers/index.html.
25. WADLER, P. 1999. A formal semantics of patterns in XSLT. Markup. Tech. 183-202.
26. WOOD, P. T. 2000. On the equivalence of XML patterns. In Proceedings of the International Conference on Deductive and Object-Oriented Databases (DOOD). 1152-1166.
27. WOOD, P. T. 2001. Minimizing simple Xpath expressions. 4th International Workshop on the Web and Databases (WebDB'2001).
28. XSCH 1999. XML Schema Part 1: Structures. http://www.w3.org/TR/1999/WD- xmlschema-l-19991217/. W3C Working Draft.
29. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In. Proceedings of the 7th Conference on Very Large Databases. Morgan-Kaufman, Los Altos, Calif.