Select-project queries over XML documents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2382, Issue , 2002, Pages 2-13

  Cohen, Sara ^a   Kanza, Yaron ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

EVALUATION ALGORITHM; INCOMPLETE INFORMATION; QUERY EVALUATION;

XML;

EID: 84937432038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45431-4_2     Document Type: Conference Paper

References (13)

1. S. Abiteboul. Querying semi-structured data. In In Proc of the 6th International Conference on Database Theory (ICDT), volume 1186 of Lectures Notes in Computer Science, pages 1–18. Springer-Verlag, January 1997.
2. S. Abiteboul, L. Segoufin, and V. Vianu. Representing and querying xml with incomplete information. In Proc of the 20th ACM Symp. on Principles of Databae Systems (PODS), Santa Barbara (California, USA), May 2001. ACM Press.
3. D. Chamberlin, J. Clark, D. Florescu, J. Robie, J. Siméon, and M. Stefanescu. XQuery 1.0: An XML query language, June 2001. Available at http://www.w3.org/TR/xquery.
4. S. Cohen, Y. Kanza, Y. A. Kogan, W. Nutt, Y. Sagiv, and A. Serebrenik. Combining the power of searching and querying. In In Proc. of the 7th International Conference on Cooperative Information Systems (CoopIS), volume 1901 of Lecture Notes in Computer Science, pages 54–65, Eilat, (Israel), September 2000. Springer.
5. S. Cohen, Y. Kanza, and Y. Sagiv. SQL4X: A flexible query language for XML and relational databases. In Informal Proc. of the 8th International Workshop on Database and Programming Languages (DBPL), Marino, (Rome, Italy), September 2001.
6. A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu. XML-QL: A query language for XML, 1998. Available at http://www.w3.org/TR/NOTE-xml-ql.
7. R. Fagin, O. Mendelzon, and J. D. Ullman. A simplified universal relation assumption and its properties. ACM Trans. on Database System (TODS), 7(3):343–360, 1982.
8. Y. Kanza, W. Nutt, and Y. Sagiv. Queries with incomplete answers over semistructured data. In Proc. of the 18th ACM SIGACT-SIGMOD-SIGART Symp. On Principles of Database Systems (PODS), pages 227–236, Philadelphia, (Pennsylvania), May 1999. ACM Press.
9. D. Maier, J. D. Ullman, and M. Y. Vardi. On the foundation of the universal relation model. ACM Trans. on Database System (TODS), 9(2):283–308, 1984.
10. A. Rajaraman and J. D. Ullman. Integrating information by outerjoins and full disjunctions. In Proc. of the 5th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Montreal, (Canada), June 1996. ACM Press.
11. Y. Sagiv. Can we use the universal instance assumption without using nulls? In Proc. of the ACM SIGMOD Symp. on on the Management of Data, pages 108–120, 1981.
12. J. D. Ullman. The U. R. strikes back. In Proc. of the ACM Symposium on Principles of Database Systems (PODS), pages 10–22, Los Angeles, (California), March 1982. ACM Press.
13. J. D. Ullman. Principles of Database and Kowledge Base Systems, volume II. Computer Science Press, 1989.