Adventures in associative-commutative unification
Journal of Symbolic Computation
Term rewriting and all that
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Computational Biology Database Digest: Data, Data Analysis, and Data Management
Distributed and Parallel Databases
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Physical Data Independence, Constraints, and Optimization with Universal Plans
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
An XML query engine for network-bound data
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Proceedings of the 2003 ACM symposium on Document engineering
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Accelerating XPath evaluation in any RDBMS
ACM Transactions on Database Systems (TODS)
The XML Stream Query Processor SPEX
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Conjunctive queries over trees
Journal of the ACM (JACM)
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
SPEX: Streamed and Progressive Evaluation of XPath
IEEE Transactions on Knowledge and Data Engineering
Evaluation of partial path queries on xml data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Assigning semantics to partial tree-pattern queries
Data & Knowledge Engineering
Efficient evaluation of generalized path pattern queries on XML data
Proceedings of the 17th international conference on World Wide Web
A heuristic approach for checking containment of generalized tree-pattern queries
Proceedings of the 17th ACM conference on Information and knowledge management
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Efficient evaluation of generalized tree-pattern queries on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Satisfiability algorithms for conjunctive queries over trees
Proceedings of the 14th International Conference on Database Theory
Relative expressive power of navigational querying on graphs
Proceedings of the 14th International Conference on Database Theory
Revisiting “forward node-selecting queries over trees”
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.01 |
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.