Document path query
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.
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...
- 1.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.Google Scholar
- 3.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.Google Scholar
- 4.Chamberlin D, Clark J, Florescu D, Robie J, Simeon J, Stefanescu M. XQuery 1.0: an XML Query Language, May 2003.Google Scholar
- 5.Clark J. XSL transformations (XSLT) version 1.0. http://www.w3.org/TR/XSLT.
- 6.Clark J, DeRose D. XML path language (XPath) version 1.0. http://www.w3.org/TR/XPATH.
- 7.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.Google Scholar
- 8.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.Google Scholar
- 9.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.Google Scholar
- 10.McHugh J, Widom J. Query optimization for XML. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999. p. 315–26.Google Scholar
- 11.Milo T, Suciu D. Index structures for path expressions. In: Proceedings of the 7th International Conference on Database Theory; 1999. p. 277–295.Google Scholar
- 13.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.Google Scholar