Synonyms
Document path query
Definition
Given a semi-structured data set D, a path query identifies nodes of interest by specifying the path lead to the nodes and the predicates associated with nodes along the path. The path is identified by specifying the labels of the nodes to be navigated and structural relationship (parent-child or ancestor-descendant) among the nodes. A predicate can be a path query itself, relative to the node that it is associated with.
Historical Background
Using path information in query processing has been studied in the object-oriented database systems, in which most queries require the traversing from one object to another following object identifiers, in the mid 1990s. The notion of path query, in which the path and predicates along the path are specified as the core of the query, became popular with the growth of the information on the web and the introduction of semi-structured data, especially XML.
Most of the popular query languages for querying XML...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Al-Khalifa S, Jagadish HV, Patel JM, Koudas N, Srivastava D, Wu Y. Structural joins: a primitive for efficient XML query pattern matching. In: Proceedings of the 18th International Conference on Data Engineering; 2002.
Benedikt M, Fan W, Kuper GM. Structural properties of XPath fragments. Theor Comput Sci. 2005;226(1):3–31.
Bruno N, Koudas N, Srivastava D. Holistic twig joins: optimal XML pattern matching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2002. p. 310–21.
Chamberlin D, Clark J, Florescu D, Robie J, Simeon J, Stefanescu M. XQuery 1.0: an XML Query Language, May 2003.
Clark J. XSL transformations (XSLT) version 1.0. http://www.w3.org/TR/XSLT.
Clark J, DeRose D. XML path language (XPath) version 1.0. http://www.w3.org/TR/XPATH.
Goldman R, Widom J. Data guides: enabling query formulation and optimization in semistructured databases. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1997. p. 436–45.
Kaushik R, Shenoy P, Bohannon P, Gudes E. Exploiting local similarity for efficient indexing of paths in graph structured data. In: Proceedings of the 18th International Conference on Data Engineering; 2002.
Koch C. Processing queries on tree-structured data efficiently. In: Proceedings of the 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2006. p. 213–24.
McHugh J, Widom J. Query optimization for XML. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999. p. 315–26.
Milo T, Suciu D. Index structures for path expressions. In: Proceedings of the 7th International Conference on Database Theory; 1999. p. 277–295.
Schmidt A, Waas F, Kersten ML, Carey MJ, Manolescu I, Busse R. XMark: a benchmark for XML data management. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 974–85.
Zhang C, Naughton JF, DeWitt DJ, Luo Q, Lohman GM. On supporting containment queries in relational database management systems. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2001.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Wu, Y. (2018). Path Query. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_140
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_140
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering