Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Journal of the ACM (JACM)
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic Logic
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Efficient algorithms for minimizing tree pattern queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reasoning in expressive description logics
Handbook of automated reasoning
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
Articulating information needs in XML query languages
ACM Transactions on Information Systems (TOIS)
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding XPath containment with MSO
Data & Knowledge Engineering
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Commutativity analysis for XML updates
ACM Transactions on Database Systems (TODS)
Semantics in Data and Knowledge Bases
Expressive, yet tractable XML keys
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Controlling Access to XML Documents over XML Native and Relational Databases
SDM '09 Proceedings of the 6th VLDB Workshop on Secure Data Management
Minimal common container of tree patterns
Proceedings of the 18th ACM conference on Information and knowledge management
Workload-aware trie indices for XML
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient rewriting of XPath queries using Query Set Specifications
Proceedings of the VLDB Endowment
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
Numerical constraints on XML data
Information and Computation
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Logic in databases: report on the LID 2008 workshop
ACM SIGMOD Record
Tree patterns with full text search
Procceedings of the 13th International Workshop on the Web and Databases
Querying XML data sources that export very large sets of views
ACM Transactions on Database Systems (TODS)
Detecting and resolving conflicts between adaptation aspects in multi-staged XML transformations
Proceedings of the 11th ACM symposium on Document engineering
ICDT'07 Proceedings of the 11th international conference on Database Theory
Commutativity analysis in XML update languages
ICDT'07 Proceedings of the 11th international conference on Database Theory
XML subtree queries: specification and composition
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
Partial Evaluation for Distributed XPath Query Processing and Beyond
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We study structural properties of each of the main sublanguages of navigational XPath (W3c Recommendation) commonly used in practice. First, we characterize the expressive power of these language fragments in terms of both logics and tree patterns. Second, we investigate closure properties, focusing on the ability to perform basic Boolean operations while remaining within the fragment. We give a complete picture of the closure properties of these fragments, treating XPath expressions both as functions of arbitrary nodes in a document tree, and as functions that are applied only at the root of the tree. Finally, we provide sound and complete axiom systems and normal forms for several of these fragments. These results are useful for simplification of XPath expressions and optimization of XML queries.