Query relaxation is the process of weakening a query to a more general one, and it is frequently employed to support approximate query answering. In this paper, rewriting systems for a wide fragment of XPath are investigated, which accomplish query relaxation through the application of simple rewriting rules transforming navigational axes and node tests into relaxed ones. Specifically, a general yet simple form of rewriting rules is considered, which subsumes the forms adopted in several rewriting systems for approximate XPath query answering. The expressiveness of rewriting systems based on this form of rules is characterized in terms of their capability of transforming a query into every more general formulation. It is shown that traditional rewriting systems are not only incomplete w.r.t. containment, but also w.r.t. the stricter form known as containment by homomorphism. This limitation is overcome by defining a set R* of rewriting rules which are still of the same simple form of traditional ones, but are expressive enough to catch at least containment by homomorphism. Then, an algorithm is proposed which exploits R* to provide approximate answers of queries along with a measure of their approximation degree.
XPath Query Relaxation through Rewriting Rules / Fazzinga, B; Flesca, Sergio; Furfaro, Filippo. - In: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING. - ISSN 1041-4347. - 23:10(2011), pp. 1583-1600.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||XPath Query Relaxation through Rewriting Rules|
|Data di pubblicazione:||2011|
|Citazione:||XPath Query Relaxation through Rewriting Rules / Fazzinga, B; Flesca, Sergio; Furfaro, Filippo. - In: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING. - ISSN 1041-4347. - 23:10(2011), pp. 1583-1600.|
|Appare nelle tipologie:||1.1 Articolo in rivista|