Skip to Main content Skip to Navigation
Conference papers

Containment of Pattern-Based Queries over Data Trees

Abstract : We study static analysis, in particular the containment problem, for analogs of conjunctive queries over XML documents. The problem has been studied for queries based on arbitrary patterns, not necessarily following the tree structure of documents. However, many applications force the syntactic shape of queries to be tree-like, as they are based on proper tree patterns. This renders previous results, crucially based on having non-tree-like features, inapplicable. Thus, we investigate static analysis of queries based on proper tree patterns. We go beyond simple navigational conjunctive queries in two ways: we look at unions and Boolean combinations of such queries as well and, crucially, all our queries handle data stored in documents, i.e., we deal with containment over data trees. We start by giving a general \Pi^p_2 upper bound on the containment of conjunctive queries and Boolean combinations for patterns that involve all types of navigation through documents. We then show matching hardness for conjunctive queries with all navigation, or their Boolean combinations with the simplest form of navigation. After that we look at cases when containment can be witnessed by homomorphisms of analogs of tableaux. These include conjunctive queries and their unions over child and next-sibling axes; however, we show that not all cases of containment can be witnessed by homomorphisms. We look at extending tree patterns used in queries in three possible ways: with wildcard, with schema information, and with data value comparisons. The first one is relatively harmless, the second one tends to increase complexity by an exponential, and the last one quickly leads to undecidability.
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00788621
Contributor : Claire David <>
Submitted on : Thursday, February 14, 2013 - 5:27:01 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM
Long-term archiving on: : Wednesday, May 15, 2013 - 4:03:34 AM

File

icdt2013.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00788621, version 1

Citation

Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens. Containment of Pattern-Based Queries over Data Trees. International Conference on Database Theory (ICDT'13), 2013, Italy. pp.12. ⟨hal-00788621⟩

Share

Metrics

Record views

1819

Files downloads

580