SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Secure and selective dissemination of XML documents
ACM Transactions on Information and System Security (TISSEC)
SilkRoute: A framework for publishing relational data in XML
ACM Transactions on Database Systems (TODS)
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Towards Federated Policy Management
POLICY '03 Proceedings of the 4th IEEE International Workshop on Policies for Distributed Systems and Networks
Dynamic XML documents with distribution and replication
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
"Share your data, keep your secrets."
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Sub-document queries over XML with XSQirrel
WWW '05 Proceedings of the 14th international conference on World Wide Web
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Querying xml with update syntax
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A heuristic approach for checking containment of generalized tree-pattern queries
Proceedings of the 17th ACM conference on Information and knowledge management
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Containment of partially specified tree-pattern queries in the presence of dimension graphs
The VLDB Journal — The International Journal on Very Large Data Bases
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
The view update problem for XML
Proceedings of the 2010 EDBT/ICDT Workshops
Query translation for XPath-based security views
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
A frequent task encountered in XML processing is to filter an input document to produce a subdocument; that is, a document whose root-to-leaf paths are root-to-leaf paths of the original document and which inherits the tree structure of the original document. These are what we mean by subtree queries, and while they are similar to XPath filters, they cannot be naturally specified either in XPath or in XQuery. Special-purpose subtree query languages provide a natural idiom for specifying this class of queries, but both composition and evaluation are problematic. In this paper we show that for natural fragments of XPath, the resulting subtree query languages are closed under composition. This closure property allows a sequence of subtree queries to be rewritten as a single subtree query, which can then be evaluated either by a subtree-query specific evaluator or via translation to XQuery. We provide a set of composition algorithms for each common XPath fragment and discuss their complexity.