Name
Abstract | ||
|---|---|---|
Query realaxation is one of the critical components for approximate query answering. Query relaxation has extensively been investigated in terms of categorical data; few studies, however, have been effectively establishes for both numerical and categorical data. In this articlem we develop a query relaxation method by exploiting hierarchial quantified data abstraction, and a novel methos for categorical data are effectively relaxed. We additinally 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 methos outperformes the conventional approaches fot he various combinations of comples queries with respect to the cost model and the number of child nodes. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.4018/jdm.2008100103 | JOURNAL OF DATABASE MANAGEMENT |
Keywords | Field | DocType |
data abstraction,nearest-neighbor search,query relaxation,semantic distance | Query optimization,Data mining,Query language,Query expansion,Categorical variable,Computer science,Range query (data structures),Sargable,Web query classification,Theoretical computer science,Spatial query | Journal |
Volume | Issue | ISSN |
19 | 4 | 1063-8016 |
Citations | PageRank | References |
4 | 0.40 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Myung Keun Shin | 1 | 20 | 1.88 |
| Soon-Young Huh | 2 | 108 | 8.53 |
| Dong-Hyun Park | 3 | 39 | 5.42 |
| Wookey Lee | 4 | 196 | 29.22 |