On Testing Satisfiability of Tree Pattern Queries

Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2004, Pages 120-131

  Lakshmanan, Laks V S ^a   Ramesh, Ganesh ^a  

^a wendy)   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34948903143     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50014-0     Document Type: Chapter

References (28)

1. A.-Y. Sihem Amer-Yahia, et al. (2001) Minimization of tree pattern queries. ACM SIGMOD Conference
2. T. Cornell (1994) On determining the consistency of partial descriptions of trees. 32nd ACL Conference
3. D. Draper, et al. (2002) Xquery 1.0 and xpath 2.0 formal semantics. Technical report, W3C
4. M.F. Fernandez, et al. (2002) Xquery 1.0 and xpath 2.0 data model. Technical report, W3C
5. J. Hidders (2003) Satisfiability of xpath expressions. DBPL
6. H.V. Jagadish, et al. (2002) Timber: A native xml database. VLDB Journal
7. C. Koch and G. Gottlob (September 2003) Xpath query processing. 9th International Workshop on Database programming Languages (DBPL) Potsdam, Germany
8. A.Y. Levy, et al. (1993) Equivalence, query-reachability, and satisfiability in datalog extensions. ACM PODS Conference
9. G. M. Kuper et al. Structural properties of xpath fragments. In ICDT 2003.
10. M. Kutz and M. Brodirsky. Pure dominance constraints. In STACS 2002.
11. L. Laks V.S. Lakshmanan, et al. (March 2004) On Testing Satisfiability of Tree Pattern Queries. Tech. Report Dept. of Computer Science, UBC http://www.cs.ubc.ca/≈laks/papers.html Available from
12. G. Miklau and D. Suciu (2002) Containment and equivalent for an xpath fragment. PODS
13. F. Neven and T. Sch (2003) Xpath containment in the presence of disjunction, dtds and variables. ICDT
14. Y. Papakonstantinou Yannis, et al. (2000) DTD Inferencefor Views of XML Data. ACM PODS Conference
15. R. Pichler, et al. (2003) The complexity of xpath query evaluation. ACM PODS Conference
16. J. Rogers and K. Vijay-Shanker (1992) Reasoning with descriptions of trees. ACL Conference
17. J. Shanmugasundaram, et al. (1999) Relational databases for querying xml documents: Limitations and opportunities. VLDB Conference
18. V. Tannen and A. Deutsch. Containment and integrity constraints for xpath fragments. In 8th KRDB, 2001.
19. I. Tatarinov, et al. (2002) Storing and querying ordered xml using a relational database system. ACM SIGMOD Conference
20. R. Treinen, et al. (2001) Dominance constraints: Algorithms and complexity. 3rd conference on Logical Aspects of Computational Linguistics
21. D. Jeffrey (1989) Principles of Database and Knowledge-base Systems Volume II: The New Technologies Computer Science Press
22. M. Vardi Moshe (1982) The complexity of relational query languages. ACM STOC 137-146.
23. P.T. Wood Peter T. (2003) Containment for xpath fragments under dtd constraints. icdt. XMark
24. http://monetdb.cwi.nl/xml/
25. Biomedical database. http://www.cs.washington.edu/research/xmldatasets/www/repository.html
26. IBM XML generator. http://www.alphaworks.ibm.com/tech/xmlgenertor
27. Wutka DTD parser. http://www.wutka.com/dtdparser.html
28. http://xqengine.sourceforge.net