Polynomial time fragments of XPath with variables

Authors:
Emmanuel Filiot;Joachim Niehren;Jean-Marc Talbot;Sophie Tison
Affiliations:
INRIA Futurs;INRIA Futurs;University of Provence;University of Lille
Venue:
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2007

Citing 12
Cited 2

Logical aspects in the study of tree languages

Proc. of the conference on Ninth colloquium on trees in algebra and programming
Matrix multiplication via arithmetic progressions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Query automata over finite trees

Theoretical Computer Science
Counting on CTL: on the expressive power of monadic path logic

Information and Computation
Efficient algorithms for processing XPath queries

ACM Transactions on Database Systems (TODS)
Temporal Logics over Unranked Trees

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Conditional XPath

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
First-order queries on structures of bounded degree are computable with constant delay

ACM Transactions on Computational Logic (TOCL)
Axiomatizing the logical core of XPath 2.0

ICDT'07 Proceedings of the 11th international conference on Database Theory
Combining temporal logics for querying XML documents

ICDT'07 Proceedings of the 11th international conference on Database Theory
MSO queries on tree decomposable structures are computable with linear delay

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
First order paths in ordered trees

ICDT'05 Proceedings of the 10th international conference on Database Theory

Navigational XPath: calculus and algebra

ACM SIGMOD Record
Efficient enumeration for conjunctive queries over x-underbar structures

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO) queries modulo linear time transformations. In this paper, we distinguish a fragment of Core XPath 2.0 that remains FO-complete with respect ton-ary queries while enjoying polynomial-time query answering.