Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints

Abstract : 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
Liste complète des métadonnées

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-01120890
Contributor : Hélène Jaudoin <>
Submitted on : Monday, March 27, 2017 - 3:40:56 PM
Last modification on : Wednesday, April 3, 2019 - 1:10:49 AM
Document(s) archivé(s) le : Wednesday, June 28, 2017 - 3:05:43 PM

File

Liris-3557.pdf
Files produced by the author(s)

Identifiers

Citation

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, Springer, 2009, pp.29. ⟨10.1007/978-3-642-00685-2_2⟩. ⟨hal-01120890⟩

Share

Metrics

Record views

756

Files downloads

42