Relaxing Queries with Hierarchical Quantified Data Abstraction

摘要

Query relaxation is one of the crucial components for approximate query answering, Query relaxation has extensively been investigated in terms of categorical data; few studies, however, have been effectively established for both numerical and categorical data. In this article, we develop a query relaxation method by exploiting hierarchical quantified data abstraction, and a novel method is proposed to quantify the semantic distances between the categorical data so that the query conditions for categorical data are effectively relaxed. We additionally introduce query relaxation algorithms to modify the approximate queries into ordinary queries, which are followed by a series of examples to represent the modification process. Our method outperformed the conventional approaches for the various combinations of complex queries with respect to the cost model and the number of child nodes.