ACM Home Page
Please provide us with feedback. Feedback
Forward node-selecting queries over trees
Full text PdfPdf (511 KB)
Source
ACM Transactions on Database Systems (TODS) archive
Volume 32 ,  Issue 1  (March 2007) table of contents
Article No. 3  
Year of Publication: 2007
ISSN:0362-5915
Author
Dan Olteanu  Universität des Saarlandes, Saarbrücken, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 86,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1206049.1206052
What is a DOI?

ABSTRACT

Node-selecting queries over trees lie at the core of several important XML languages for the web, such as the node-selection language XPath, the query language XQuery, and the transformation language XSLT. The main syntactic constructs of such queries are the backward predicates, for example, ancestor and preceding, and the forward predicates, for example, descendant and following. Forward predicates are included in the depth-first, left-to-right preorder relation associated with the input tree, whereas backward predicates are included in the inverse of this preorder relation.

This work is devoted to an expressiveness study of node-selecting queries with proven theoretical and practical applicability, especially in the field of query evaluation against XML streams. The main question it answers positively is whether, for each input query with forward and backward predicates, there exists an equivalent forward-only output query. This question is then positively answered for input and output queries of varying structural complexity, using LOGLIN and PSPACE reductions.

Various existing applications based on the results of this work are reported, including query optimization and streamed evaluation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
Apache Project. 2001a. Cocoon 2.0: XML publishing framework. http://xml.apache.org/cocoon/index.html.
 
5
Apache Project. 2001b. Xalan-Java, version 2.2. http://xml.apache.org/xalan-j/index.html.
 
6
 
7
Barton, C., Charles, P., Goyal, D., Raghavachari, M., Fontoura, M., and Josifovski, V. 2003. Streaming XPath processing with forward and backward axes. In Proceedings of the International Conference on Data Engineering (ICDE). 455--466.
 
8
 
9
Boag, S., Chamberlin, D., Fernandez, M. F., Florescu, D., Robie, J., and Siméon, J. 2006. XQuery 1.0: An XML query language. Candidate recommendation, World Wide Web Consortium.
 
10
 
11
 
12
 
13
Clark, J. 1999. XSL Transformations (XSLT) version 1.0. W3C recommendation, World Wide Web Consortium.
 
14
Clark, J. and DeRose, S. 1999. XML path language (XPath) version 1.0. W3C recommendation, World Wide Web Consortium.
 
15
DeRose, S., Jr., R. D., Grosso, P., Maler, E., Marsh, J., and Walsh, N. 2002. XML pointer language (XPointer). W3C recommendation, World Wide Web Consortium. http://www.w3.org/TR/xptr/.
 
16
Desai, A. 2001. Introduction to sequential XPath. In Proceedings of the IDEAlliance XML Conference.
 
17
Fallside, D. C. and Walmsley, P. 2001. XML-Schema. W3C recommendation, World Wide Web Consortium. http://www.w3.org/XML/Schema.
 
18
Flesca, S., Furfaro, F., and Masciari, E. 2003. On the minimization of XPath queries. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 153--164.
 
19
Gottlob, G., Koch, C., and Pichler, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 95--106.
20
21
22
 
23
 
24
Hidders, J. and Michiels, P. 2003. Avoiding unnecessary ordering operations in XPath. In Proceedings of the International Conference on Data Base Programming Languages (DBPL). 54--70.
 
25
Ide, N., Bonhomme, P., and Romary, L. 2000. XCES: An XML-Based standard for linguistic corpora. In Proceedings of the Annual Conference on Language Resources and Evaluation (LREC) 825--830.
 
26
 
27
Kay, M. 2004. XSL Transformations (XSLT), version 2.0. Working draft, World Wide Web Consortium.
 
28
 
29
Marian, A. and Siméon, J. 2003. Projecting XML documents. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 213--224.
30
 
31
NASA. 2004. XML group resources page. http://xml.gsfc.nasa.gov/.
 
32
Newman, M. H. A. 1942. On theories with a combinatorial definition of ‘equivalence’. Ann. Math. 43, 2, 223--243.
 
33
Olteanu, D. 2004. Evaluation of XPath queries against XML streams. Ph.D. thesis, University of Munich.
 
34
Olteanu, D., Furche, T., and Bry, F. 2004. Evaluating complex queries against XML streams with polynomial combined complexity. In Proceedings of the Annual British National Conference on Databases (BNCOD). 31--44.
 
35
 
36
 
37
Raghavan, V., Deschler, K., and Rundensteiner, E. A. 2005. Vamana: A scalable cost-driven XPath engine. In International Workshop on XML Schema and Data Management (XSDM).
38
 
39
Wood, P. T. 2001. Minimizing simple XPath expressions. In Proceedings of the International Workshop on Web and Databases (WebDB). 13--18.