Reference Hub5
Relaxing Queries with Hierarchical Quantified Data Abstraction

Relaxing Queries with Hierarchical Quantified Data Abstraction

Myung Keun Shin, Soon Young Huh, Donghyun Park, Wookey Lee
Copyright: © 2008 |Volume: 19 |Issue: 4 |Pages: 15
ISSN: 1063-8016|EISSN: 1533-8010|ISSN: 1063-8016|EISBN13: 9781615200405|EISSN: 1533-8010|DOI: 10.4018/jdm.2008100103
Cite Article Cite Article

MLA

Shin, Myung Keun, et al. "Relaxing Queries with Hierarchical Quantified Data Abstraction." JDM vol.19, no.4 2008: pp.47-61. http://doi.org/10.4018/jdm.2008100103

APA

Shin, M. K., Huh, S. Y., Park, D., & Lee, W. (2008). Relaxing Queries with Hierarchical Quantified Data Abstraction. Journal of Database Management (JDM), 19(4), 47-61. http://doi.org/10.4018/jdm.2008100103

Chicago

Shin, Myung Keun, et al. "Relaxing Queries with Hierarchical Quantified Data Abstraction," Journal of Database Management (JDM) 19, no.4: 47-61. http://doi.org/10.4018/jdm.2008100103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.