article

Semantic characterizations of navigational XPath

Authors:

Maarten de RijkeAuthors Info & Claims

ACM SIGMOD Record, Volume 34, Issue 2

Pages 41 - 46

https://doi.org/10.1145/1083784.1083792

Published: 01 June 2005 Publication History

Abstract

We give semantic characterizations of the expressive power of navigational XPath (a.k.a. Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes and sets of paths in an XML document tree. We consider both uses. For sets of nodes, XPath is equally expressive as first order logic in two variables. For paths, XPath can be defined using four simple connectives, which together yield the class of first order definable relations which are safe for bisimulation. Furthermore, we give a characterization of the XPath expressible paths in terms of conjunctive queries.

References

[1]

L. Afanasiev, M. Francheschet, M. Marx, and M. de Rijke. CTL Model Checking for Processing Simple XPath Queries. In Proc. TIME 2004, 2004.

Digital Library

[2]

M. Benedikt, W. Fan, and G. Kuper. Structural properties of XPath fragments. In Proceedings. ICDT 2003, 2003.

Digital Library

[3]

G. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. Information Systems, 27(1):21--39, 2002.

Digital Library

[4]

P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.

Digital Library

[5]

P. Blackburn, W. Meyer-Viol, and M. de Rijke. A proof system for finite trees. In CSL'96, pages 86--105, 1996.

Digital Library

[6]

K. Etessami, M. Vardi, and Th. Wilke. First-order logic with two variables and unary temporal logic.

[7]

G. Gottlob and C. Koch. Monadic queries over tree-structured data. In Proc. LICS, Copenhagen, 2002.

Digital Library

[8]

G. Gottlob, C. Koch, and R. Pichler. The complexity of XPath query evaluation. In PODS'03, pages 179--190, 2003.

Digital Library

[9]

G. Gottlob, C. Koch, and K. Schulz. Conjunctive queries over trees. In Proc. PODS, pages 189--200, 2004.

Digital Library

[10]

M. Marx. Conditional XPath, the first order complete XPath dialect. In Proc. PODS'04, pages 13--22, 2004.

Digital Library

[11]

M. Marx. First order paths in ordered trees. In T. Eiter and L. Libkin, editors, Proc. ICDT 2005, volume 3363 of LNCS, pages 114--128, 2005.

Digital Library

[12]

G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. PODS'02, pages 65--76, 2002.

Digital Library

[13]

T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In Proc. PODS, pages 11--22. ACM, 2000.

Digital Library

[14]

M. Murata. Extended path expressions for XML. In Proc. PODS, 2001.

Digital Library

[15]

F. Neven and T. Schwentick. Expressive and efficient pattern languages for tree-structured data. In Proc. PODS, pages 145--156. ACM, 2000.

Digital Library

[16]

V. Vianu. A Web odyssey: from Codd to XML. In Proc. PODS, pages 1--15. ACM Press, 2001.

Digital Library

[17]

W3C. XML path language (XPath): Version 1.0. http://www.w3.org/TR/xpath.html.

[18]

W3C. XML path language (XPath): Version 2.0. http://www.w3.org/TR/xpath20/.

[19]

W3C. XML schema part 1: Structures. http://www.w3.org/TR/xmlschema-1.

[20]

W3C. XQuery 1.0: A query language for XML. http://www.w3.org/TR//xquery/.

[21]

W3C. XSL transformations language (XSLT): Version 2.0. http://www.w3.org/TR/xslt20/.

[22]

P. Wadler. Two semantics for XPath. Technical report, Bell Labs, 2000.

Cited By

Guo QZhang CZhang SLu J(2024)Multi-model query languages: taming the variety of big dataDistributed and Parallel Databases10.1007/s10619-023-07433-142:1(31-71)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s10619-023-07433-1
Hellings JGyssens MVan Den Bussche JVan Gucht D(2023)Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS56636.2023.10175828(1-13)Online publication date: 26-Jun-2023
https://doi.org/10.1109/LICS56636.2023.10175828
Hellings JWu YGyssens MVan Gucht D(2022)The power of Tarski's relation algebra on treesJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2022.100748126(100748)Online publication date: Apr-2022
https://doi.org/10.1016/j.jlamp.2022.100748
Show More Cited By

Index Terms

Semantic characterizations of navigational XPath

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 ...
Characterizations for ${XPath}_{R}^{} (↓)$
Logic, Language, Information, and Computation
Abstract
Over the semantic universe of trees augmented with arbitrary sets of relations between nodes, we study model-theoretic properties of the extension ${XPath}_{R}^{} (↓)$ of the downward fragment of XPath, equipped with a finite set $R$ of relation symbols. We ... $_{}^{}$ $_{}$
XPath and XPointer: Locating Content in XML Documents

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 34, Issue 2

June 2005

91 pages

ISSN:0163-5808

DOI:10.1145/1083784

Issue’s Table of Contents

Copyright © 2005 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2005

Published in SIGMOD Volume 34, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

69
Total Citations
View Citations
429
Total Downloads

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

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Guo QZhang CZhang SLu J(2024)Multi-model query languages: taming the variety of big dataDistributed and Parallel Databases10.1007/s10619-023-07433-142:1(31-71)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s10619-023-07433-1
Hellings JGyssens MVan Den Bussche JVan Gucht D(2023)Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS56636.2023.10175828(1-13)Online publication date: 26-Jun-2023
https://doi.org/10.1109/LICS56636.2023.10175828
Hellings JWu YGyssens MVan Gucht D(2022)The power of Tarski's relation algebra on treesJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2022.100748126(100748)Online publication date: Apr-2022
https://doi.org/10.1016/j.jlamp.2022.100748
Hellings JPilachowski CVan Gucht DGyssens MWu Y(2020)From Relation Algebra to Semi-join Algebra: An Approach to Graph Query OptimizationThe Computer Journal10.1093/comjnl/bxaa03164:5(789-811)Online publication date: 9-May-2020
https://doi.org/10.1093/comjnl/bxaa031
Yao XPlötz TJohnson MBarbaro K(2019)Automated Detection of Infant Holding Using Wearable SensingProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/33289353:2(1-17)Online publication date: 21-Jun-2019
https://dl.acm.org/doi/10.1145/3328935
Hague MLin AHong C(2019)CSS Minification via Constraint SolvingACM Transactions on Programming Languages and Systems10.1145/331033741:2(1-76)Online publication date: 19-Jun-2019
https://dl.acm.org/doi/10.1145/3310337
Hellings JGyssens MWu YVan Gucht DVan den Bussche JVansummeren SFletcher G(2019)Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on treesInformation Systems10.1016/j.is.2019.101467(101467)Online publication date: Nov-2019
https://doi.org/10.1016/j.is.2019.101467
Surinx DVan den Bussche JVan Gucht D(2019)A framework for comparing query languages in their ability to express boolean queriesAnnals of Mathematics and Artificial Intelligence10.1007/s10472-019-09639-587:1-2(157-184)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1007/s10472-019-09639-5
Surinx DVan den Bussche JVan Gucht D(2018)A Framework for Comparing Query Languages in Their Ability to Express Boolean QueriesFoundations of Information and Knowledge Systems10.1007/978-3-319-90050-6_20(360-378)Online publication date: 18-Apr-2018
https://doi.org/10.1007/978-3-319-90050-6_20
Hellings JWu YGyssens MVan Gucht D(2018)The Power of Tarski’s Relation Algebra on TreesFoundations of Information and Knowledge Systems10.1007/978-3-319-90050-6_14(244-264)Online publication date: 18-Apr-2018
https://doi.org/10.1007/978-3-319-90050-6_14
Show More Cited By

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 Issue’s Table of Contents