Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal on Data Semantics Année : 2009

Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints

Résumé

In this paper, we investigate the problem of query rewriting using views in a hybrid language allowing nominals (i.e., individual names) to occur in intentional descriptions. Of particular interest, restricted form of nominals where individual names refer to simple values enable the specification of value constraints, i.e, sets of allowed values for attributes. Such constraints are very useful in practice enabling, for example, fine-grained description of queries and views in integration systems and thus can be exploited to reduce the query processing cost. We use description logics to formalize the problem of query rewriting using views in presence of value constraints and show that the technique of query rewriting can be used to process queries under the certain answer semantics. We propose a sound and complete query rewriting Bucket-like algorithm. Data mining techniques have been used to favor scalability w.r.t. the number of views. Experiments on synthetic datasets have been conducted
Fichier principal
Vignette du fichier
Liris-3557.pdf (436.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01120890 , version 1 (27-03-2017)

Identifiants

Citer

Hélène Jaudoin, Frédéric Flouvat, Jean-Marc Petit, Farouk Toumani. Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints. Journal on Data Semantics, 2009, pp.29. ⟨10.1007/978-3-642-00685-2_2⟩. ⟨hal-01120890⟩
405 Consultations
148 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More