Abstract
This paper discusses evaluation of select-project (SP) queries over an XML document. A SP query consists of two parts: (1) a conjunction of conditions on values of labels (called the selection) and (2) a series of labels whose values should be outputed (called the projection). Query evaluation involves finding tuples of nodes that have the labels mentioned in the query and are related to one another other in a meaningful fashion. Several different semantics for query evaluation are given in this paper. Some of these semantics also take into account the possible presence of incomplete information. The complexity of query evaluation is analyzed and evaluation algorithms are described.
Supported by Grant 96/01-1 from the Israel Science Foundation
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
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.
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.
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.
Y. Kanza, W. Nutt, and Y. Sagiv. Queries with incomplete answers over semi-structured 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.
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.
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.
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.
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.
J. D. Ullman. Principles of Database and Kowledge Base Systems, volume II. Computer Science Press, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, S., Kanza, Y., Sagiv, Y. (2002). Select-Project Queries over XML Documents. In: Halevy, A., Gal, A. (eds) Next Generation Information Technologies and Systems. NGITS 2002. Lecture Notes in Computer Science, vol 2382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45431-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-45431-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43819-9
Online ISBN: 978-3-540-45431-1
eBook Packages: Springer Book Archive