Characterizing XML Twig Queries with Examples - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Characterizing XML Twig Queries with Examples


Typically, a (Boolean) query is a finite formula that defines a possibly infinite set of database instances that satisfy it (positive examples), and implicitly, the set of instances that do not satisfy the query (negative examples). We investigate the following natural question: for a given class of queries, is it possible to characterize every query with a finite set of positive and negative examples that no other query is consistent with. We study this question for twig queries and XML databases. We show that while twig queries are characterizable, they generally require exponential sets of examples. Consequently, we focus on a practical subclass of anchored twig queries and show that not only are they characterizable but also with polynomially-sized sets of examples. This result is obtained with the use of generalization operations on twig queries, whose application to an anchored twig query yields a properly contained and minimally different query. Our results illustrate further interesting and strong connections between the structure and the semantics of anchored twig queries that the class of arbitrary twig queries does not enjoy. Finally, we show that the class of unions of twig queries is not characterizable.
Fichier principal
Vignette du fichier
staworko-icdt15b.pdf (597.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01205417 , version 1 (25-09-2015)


Public Domain


  • HAL Id : hal-01205417 , version 1


Slawomir Staworko, Piotr Wieczorek. Characterizing XML Twig Queries with Examples. International Conference on Database Theory, Mar 2015, Brussels, Belgium. ⟨hal-01205417⟩
159 View
91 Download


Gmail Facebook Twitter LinkedIn More