The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2000)
San Diego, California
Feb. 28, 2000 to Mar. 3, 2000
ISSN: 1063-6382
ISBN: 0-7695-0506-6
pp: 196
Kaushik Chakrabarti , University of Illinois at Urbana-Champaign
Sharad Mehrotra , University of California at Irvine
Kriengkrai Porkaew , University of Illinois at Urbana-Champaign
ABSTRACT
The proposed approaches are independent of the refinement model used (e.g., QPM or QEX) and hence work for all models. Our first contribution is to generalize the notion of similarity queries and allow multiple query points in a query (referred to as multipoint queries). This generalization is necessary since refined queries cannot be always expressed as single point queries.We develop a k-NN algorithm that can handle multipoint queries and show that it performs significantly better than the naive approach (i.e. execute several single point queries using the 'single-point' k-NN algorithm and merge results). The second and the main problem we address is how to evaluate refined queries efficiently.
INDEX TERMS
CITATION
Kaushik Chakrabarti, Sharad Mehrotra, Kriengkrai Porkaew, "Efficient Query Refinement in Multimedia Databases", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 196, 2000, doi:10.1109/ICDE.2000.839410
109 ms
(Ver )