The Community for Technology Leaders
Green Image
Issue No. 10 - October (2011 vol. 23)
ISSN: 1041-4347
pp: 1583-1600
Bettina Fazzinga , University of Calabria, Rende
Sergio Flesca , University of Calabria, Rende
Filippo Furfaro , University of Calabria, Rende
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 {\cal R}^{\ast} 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 {\cal R}^{\ast} to provide approximate answers of queries along with a measure of their approximation degree.
XPath, query relaxation, approximate query answering, information systems.

B. Fazzinga, F. Furfaro and S. Flesca, "XPath Query Relaxation through Rewriting Rules," in IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 1583-1600, 2010.
84 ms
(Ver 3.3 (11022016))