Relaxing Queries with Hierarchical Quantified Data Abstraction

Relaxing Queries with Hierarchical Quantified Data Abstraction

Myung Keun Shin (Korea Advanced Institute of Science and Technology, South Korea), Soon Young Huh (Korea Advanced Institute of Science and Technology, South Korea), Donghyun Park (Inha University, South Kore) and Wookey Lee (Inha University, South Korea)
Copyright: © 2008 |Pages: 15
DOI: 10.4018/jdm.2008100103
OnDemand PDF Download:
$37.50

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.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 28: 4 Issues (2017): Forthcoming, Available for Pre-Order
Volume 27: 4 Issues (2016): 2 Released, 2 Forthcoming
Volume 26: 4 Issues (2015)
Volume 25: 4 Issues (2014)
Volume 24: 4 Issues (2013)
Volume 23: 4 Issues (2012)
Volume 22: 4 Issues (2011)
Volume 21: 4 Issues (2010)
Volume 20: 4 Issues (2009)
Volume 19: 4 Issues (2008)
Volume 18: 4 Issues (2007)
Volume 17: 4 Issues (2006)
Volume 16: 4 Issues (2005)
Volume 15: 4 Issues (2004)
Volume 14: 4 Issues (2003)
Volume 13: 4 Issues (2002)
Volume 12: 4 Issues (2001)
Volume 11: 4 Issues (2000)
Volume 10: 4 Issues (1999)
Volume 9: 4 Issues (1998)
Volume 8: 4 Issues (1997)
Volume 7: 4 Issues (1996)
Volume 6: 4 Issues (1995)
Volume 5: 4 Issues (1994)
Volume 4: 4 Issues (1993)
Volume 3: 4 Issues (1992)
Volume 2: 4 Issues (1991)
Volume 1: 2 Issues (1990)
View Complete Journal Contents Listing