Article

Polynomial time fragments of XPath with variables

Authors:

Emmanuel Filiot,

Joachim Niehren,

Jean-Marc Talbot,

Sophie TisonAuthors Info & Claims

PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 205 - 214

https://doi.org/10.1145/1265530.1265559

Published: 11 June 2007 Publication History

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.

References

[1]

N. Alechina, S. Demri, and M. de Rijke. A modal perspective on path constraints. Journal of Logic and Computation, 13(6):939--956, 2003.

[2]

Marcelo Arenas, Pablo Barcelo, and Leonid Libkin. Combining temporal logics for querying XML documents. In International Conference on Database Theory, 2007.

Digital Library

[3]

Guillaume Bagan. MSO queries on tree decomposable structures are computable with linear delay. In CSL, 2006.

Digital Library

[4]

Pablo Barcelo and Leonid Libkin. Temporal logics over unranked trees. In LICS, pages 31--40. 2005.

Digital Library

[5]

Michael Benedikt and Christoph Koch. XPath leashed. 2006. submitted.

[6]

Patrick Blackburn and Jerry Seligman. Hybrid languages. Journal of Logic, Language and Information, 4(3):251--272, 1995.

[7]

D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. ACM conference on Theory of computing, 1987.

Digital Library

[8]

Bruno Courcelle. Linear delay enumeration and monadic second-order logic. 2006. submitted.

[9]

Arnaud Durand and Etienne Grandjean. The Complexity of Acyclic Conjunctive Queries Revisited. 2004.

[10]

Arnaud Durand and Etienne Grandjean. First-order queries on structures of bounded degree are computable with constant delay. ACM Transactions on Computational Logics, 2006.

Digital Library

[11]

H. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, Berlin, 1999.

[12]

M. Franceschet and E. Zimuel. Modal logic and navigational xpath: an experimental comparison. In Proceedings of Workshop Methods for Modalities, pages 156--172, 2005.

[13]

Georg Gottlob, Christoph Koch, and Reinhard Pichler. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2):444--491, 2005.

Digital Library

[14]

Leonid Libkin. Logics over unranked trees: an overview. Logical Methods in Computer Science, 32):1--31, 2006.

[15]

Maarten Marx. Conditional XPath. ACM Transactions on Database Systems, 30(4):929--959, 2005.

Digital Library

[16]

Maarten Marx. First order paths in ordered trees. In International Conference on Database Theory, pages 114--128, 2005.

Digital Library

[17]

F. Moller and A. Rabinovich. Counting on CTL: on the expressive power of monadic path logic. Information and Computation, 184(1):147--159, 2003.

Digital Library

[18]

Frank Neven and Thomas Schwentick. Query automata over finite trees. TCS, 275(1-2):633--674, 2002.

Digital Library

[19]

Thomas Schwentick. On diving in trees. In MFCS, pages 660--669, 2000.

Digital Library

[20]

S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379--419, 1975.

[21]

L. J. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Department of Electrical Engineering, MIT, 1974.

[22]

Balder ten Cate and Maarten Marx. Axiomatizing the logical core of XPath 2.0. In ICDT, 2007.

Digital Library

[23]

Wolfgang Thomas. Logical aspects in the study of tree languages. In 9th International Colloquium on Trees in Algebra and Programming, pages 31--50, 1984.

Digital Library

[24]

Mihalis Yannakakis. Algorithms for acyclic database schemes. In Proceeding of VLDB, pages 82--94, 1981.

Cited By

Alrammal MHains G(2013)A Research Survey on Large XML Data: Streaming, Selectivity Estimation and ParallelismInter-cooperative Collective Intelligence: Techniques and Applications10.1007/978-3-642-35016-0_7(167-202)Online publication date: 14-Aug-2013
https://doi.org/10.1007/978-3-642-35016-0_7
Bagan GDurand AFiliot EGauwin O(2010)Efficient Enumeration for Conjunctive Queries over X-underbar StructuresComputer Science Logic10.1007/978-3-642-15205-4_10(80-94)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15205-4_10
Marx M(2009)Logical Foundations of XML and XQueryReasoning Web. Semantic Technologies for Information Systems10.1007/978-3-642-03754-2_3(111-157)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1007/978-3-642-03754-2_3
Show More Cited By

Index Terms

Polynomial time fragments of XPath with variables

Recommendations

Conditional XPath
Special Issue: SIGMOD/PODS 2004

XPath 1.0 is a variable free language designed to specify paths between nodes in XML documents. Such paths can alternatively be specified in first-order logic. The logical abstraction of XPath 1.0, usually called Navigational or Core XPath, is not ...
Reformulating XPath queries and XSLT queries on XSLT views

Applications using XML for data representation very often use different XML formats and thus require the transformation of XML data. The common approach transforms entire XML documents from one format into another, e.g. by using an XSLT stylesheet. ...
Filtering XPath expressions for XML access control

XPath is a standard for specifying parts of XML documents and a suitable language for both query processing and access control of XML. In this paper, we use the XPath expression for representing user queries and access control for XML. And we propose an ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2007

328 pages

ISBN:9781595936851

DOI:10.1145/1265530

General Chair:
Phokion Kolaitis
IBM Almaden
,
Program Chair:
Leonid Libkin
University of Edinburgh

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 June 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGMOD/PODS07

Sponsor:

SIGMOD/PODS07: International Conference on Management of Data

June 11 - 13, 2007

Beijing, China

Acceptance Rates

PODS '07 Paper Acceptance Rate 28 of 187 submissions, 15%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
233
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Alrammal MHains G(2013)A Research Survey on Large XML Data: Streaming, Selectivity Estimation and ParallelismInter-cooperative Collective Intelligence: Techniques and Applications10.1007/978-3-642-35016-0_7(167-202)Online publication date: 14-Aug-2013
https://doi.org/10.1007/978-3-642-35016-0_7
Bagan GDurand AFiliot EGauwin O(2010)Efficient Enumeration for Conjunctive Queries over X-underbar StructuresComputer Science Logic10.1007/978-3-642-15205-4_10(80-94)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15205-4_10
Marx M(2009)Logical Foundations of XML and XQueryReasoning Web. Semantic Technologies for Information Systems10.1007/978-3-642-03754-2_3(111-157)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1007/978-3-642-03754-2_3
Filiot ETison S(2008)Regular n-ary Queries in Trees and Variable IndependenceFifth Ifip International Conference On Theoretical Computer Science – Tcs 200810.1007/978-0-387-09680-3_29(429-443)Online publication date: 2008
https://doi.org/10.1007/978-0-387-09680-3_29
ten Cate BMarx M(2007)Navigational XPathACM SIGMOD Record10.1145/1328854.132885836:2(19-26)Online publication date: 1-Jun-2007
https://dl.acm.org/doi/10.1145/1328854.1328858

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents