Characterizing XML Twig Queries with Examples

Staworko, Slawomir; Wieczorek, Piotr

Document type :

Communication dans un congrès avec actes

Title :

Characterizing XML Twig Queries with Examples

Author(s) :

Staworko, Slawomir [Auteur]
Linking Dynamic Data [LINKS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Wieczorek, Piotr [Auteur]
University of Wrocław [Poland] [UWr]

Conference title :

International Conference on Database Theory

City :

Brussels

Country :

Belgique

Start date of the conference :

2015-03

Book title :

International Conference on Database Theory

Journal title :

International Conference on Database Theory

Publication date :

2015-03

English keyword(s) :

Query characterization
Query examples
Query fitting
Twig queries

HAL domain(s) :

Informatique [cs]/Base de données [cs.DB]

English abstract : [en]

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 ...
Show more >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.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Files

https://hal.inria.fr/hal-01205417/document
Open access
Access the document

https://hal.inria.fr/hal-01205417/document
Open access
Access the document

https://hal.inria.fr/hal-01205417/document
Open access
Access the document

document
Open access
Access the document

staworko-icdt15b.pdf
Open access
Access the document

Characterizing XML Twig Queries with Examples BibTeX CSV Excel RIS

Files

Characterizing XML Twig Queries with Examples

BibTeX

CSV

Excel

RIS