Relaxing queries with hierarchical quantified data abstraction

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.
Publisher
IGI PUBL
Issue Date
2008-10
Language
ENG
Keywords

PERFORMANCE

Citation

JOURNAL OF DATABASE MANAGEMENT, v.19, no.4, pp.47 - 61

ISSN
1063-8016
DOI
10.4018/jdm.2008100103
URI
http://hdl.handle.net/10203/8765
Appears in Collection
KSIM-Journal Papers(저널논문)
  • Hit : 257
  • Download : 13
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0