column

Navigational XPath: calculus and algebra

Authors:

Balder ten Cate,

Maarten MarxAuthors Info & Claims

ACM SIGMOD Record, Volume 36, Issue 2

Pages 19 - 26

https://doi.org/10.1145/1328854.1328858

Published: 01 June 2007 Publication History

Get Access

Abstract

We survey expressivity results for navigational fragments of XPath 1.0 and 2.0, as well as Regular XPath≈. We also investigate algebras for these fragments.

References

[1]

S. Abiteboul, P. Buneman, and D. Suciu. Data on the web. Morgan Kaufman, 2000.

Google Scholar

[2]

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

Digital Library

Google Scholar

[3]

A. Chandra and D. Harel. Structure and complexity of relational queries. J. Comput. Syst. Sci., 25(1):99--128, 1982.

Crossref

Google Scholar

[4]

E. Codd. Relational completeness of data base sublanguages. In R. Rustin, editor, Database Systems, pages 33--64. Prentice-Hall, 1972.

Google Scholar

[5]

J. Engelfriet and H. Hoogeboom. Nested pebbles and transitive closure. In Proc. STACS, pages 477--488, 2006.

Digital Library

Google Scholar

[6]

W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. SMOQE: a system for providing secure access to XML. In Proc. VLDB'2006, pages 1227--1230, 2006.

Digital Library

Google Scholar

[7]

W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Rewriting regular XPath queries on XML views. In Proc. ICDE'2007, 2007.

Crossref

Google Scholar

[8]

E. Filiot, J. Niehren, J.-M. Talbot, and S. Tison. Polynomial time fragments of xpath with variables. In Proc. PODS'07, 2007.

Digital Library

Google Scholar

[9]

E. Goris and M. Marx. Looping caterpillars. In Proc. LICS 2005. IEEE Computer Society, 2005.

Digital Library

Google Scholar

[10]

G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB'02, 2002.

Digital Library

Google Scholar

[11]

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

Digital Library

Google Scholar

[12]

M. Grohe and N. Schweikardt. The succinctness of first-order logic on linear orders. 1(1), 2005.

Google Scholar

[13]

I. Hodkinson and M. Reynolds. Separation - past, present, and future. In S. Artemov et al., editor, We will show them! (Essays in honour of Dov Gabbay on his 60th birthday), pages 117--142. College Publications, 2005.

Google Scholar

[14]

M. Hollenberg. An equational axiomatization of dynamic negation and relational composition. Journal of Logic, Language and Information, 6(4):381--401, 1997.

Digital Library

Google Scholar

[15]

J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.

Google Scholar

[16]

M. Kay. XPath 2.0 Programmer's Reference. Wrox, 2004.

Google Scholar

[17]

M. Marx. XPath with conditional axis relations. In Proc. EDBT'04, volume 2992 of LNCS, pages 477--494, 2004.

Google Scholar

[18]

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

Digital Library

Google Scholar

[19]

M. Marx and M. de Rijke. Semantic Characterizations of Navigational XPath. SIGMOD Record, 34(2):41--46, 2005.

Digital Library

Google Scholar

[20]

F. Neven and T. Schwentick. XPath containment in the presence of disjunction, DTDs, and variables. In Proc. ICDT 2003, 2003.

Digital Library

Google Scholar

[21]

L. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Dept. Electrical Engineering, MIT, Cambridge, Mass., 1974.

Google Scholar

[22]

A. Tarski. On the calculus of relations. Journal of Symbolic Logic, 6:73--89, 1941.

Crossref

Google Scholar

[23]

A. Tarski and S. Givant. A Formalization of Set Theory without Variables, volume 41. AMS Colloquium publications, Providence, Rhode Island, 1987.

Google Scholar

[24]

B. ten Cate. The expressivity of XPath with transitive closure. In Proc. PODS, pages 328--337, 2006.

Digital Library

Google Scholar

[25]

B. ten Cate and C. Lutz. The complexity of query containment in expressive fragments of XPath 2.0. In Proc. PODS'07, 2007.

Digital Library

Google Scholar

[26]

B. ten Cate and M. Marx. Axiomatizing the logical core of XPath 2.0. In Proc. ICDT'07, 2007.

Digital Library

Google Scholar

[27]

J. van Benthem. Program constructions that are safe for bisimulation. Studia Logica, 60(2):331--330, 1998.

Crossref

Google Scholar

[28]

M. Vardi. On the complexity of bounded-variable queries. In Proc. PODS'95, pages 266--276, 1995.

Digital Library

Google Scholar

Cited By

View all

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
Chen RCai GChen JHong Y(2023)Integrated method for distributed processing of large XML dataCluster Computing10.1007/s10586-023-04010-027:2(1375-1399)Online publication date: 13-May-2023
https://dl.acm.org/doi/10.1007/s10586-023-04010-0
Show More Cited By

Index Terms

Navigational XPath: calculus and algebra
1. General and reference
2. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus
  2. Mathematical analysis
    1. Calculus
      1. Lambda calculus

Recommendations

Semantic characterizations of navigational XPath

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 ...
XPath and XPointer: Locating Content in XML Documents
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 ...

Comments

Information & Contributors

Information

Published In

ACM SIGMOD Record Volume 36, Issue 2

June 2007

38 pages

ISSN:0163-5808

DOI:10.1145/1328854

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2007

Published in SIGMOD Volume 36, Issue 2

Check for updates

Qualifiers

Column

Funding Sources

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
261
Total Downloads

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

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

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
Chen RCai GChen JHong Y(2023)Integrated method for distributed processing of large XML dataCluster Computing10.1007/s10586-023-04010-027:2(1375-1399)Online publication date: 13-May-2023
https://dl.acm.org/doi/10.1007/s10586-023-04010-0
Chen RWang ZSu HXie SWang Z(2022)Parallel XPath query based on cost optimizationThe Journal of Supercomputing10.1007/s11227-021-04074-y78:4(5420-5449)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1007/s11227-021-04074-y
Sharma CSinha RJohnson K(2021)Practical and comprehensive formalisms for modelling contemporary graph query languagesInformation Systems10.1016/j.is.2021.101816102:COnline publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1016/j.is.2021.101816
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
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
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.

Cited By

Index Terms

Recommendations

Semantic characterizations of navigational XPath

XPath and XPointer: Locating Content in XML Documents

Conditional XPath

Comments

Published In

Publisher

Publication History

Check for updates

Qualifiers

Funding Sources

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Semantic characterizations of navigational XPath

XPath and XPointer: Locating Content in XML Documents

Conditional XPath

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Funding Sources

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations