Axiomatizing the logical core of XPath 2.0

Authors:
Balder ten Cate;Maarten Marx
Affiliations:
ISLA – Informatics Institute, Universiteit van Amsterdam;ISLA – Informatics Institute, Universiteit van Amsterdam
Venue:
ICDT'07 Proceedings of the 11th international conference on Database Theory
Year:
2007

Citing 8
Cited 12

Descriptive Approach to Language - Theoretic Complexity

Descriptive Approach to Language - Theoretic Complexity
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
The complexity of translating logic to finite automata

Automata logics, and infinite games
Conditional XPath

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Structural characterizations of the semantics of XPath as navigation tool on a document

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-Variable Logic on Words with Data

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Satisfiability of XPath queries with sibling axes

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages

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
Polynomial time fragments of XPath with variables

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Navigational XPath: calculus and algebra

ACM SIGMOD Record
XPath, transitive closure logic, and nested tree walking automata

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
The complexity of query containment in expressive fragments of XPath 2.0

Journal of the ACM (JACM)
Transitive closure logic, nested tree walking automata, and XPath

Journal of the ACM (JACM)
Logic in databases: report on the LID 2008 workshop

ACM SIGMOD Record
On the expressiveness of generalization rules for XPath query relaxation

Proceedings of the Fourteenth International Database Engineering & Applications Symposium
From regular expressions to nested words: unifying languages and query execution for relational and XML sequences

Proceedings of the VLDB Endowment
High-performance complex event processing over XML streams

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
High-performance complex event processing over hierarchical data

ACM Transactions on Database Systems (TODS) - Invited papers issue

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex counting conditions and data joins are not supported, as they lead to undecidability). The second aim is to provide a list of equations completely axiomatizing query equivalence in this language (i.e., all other query equivalences can be derived from these).