Efficient Query Refinement in Multimedia Databases

25 August 2005

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

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.

Keywords

This publication has 2 references indexed in Scilit:

The hybrid tree: an index structure for high dimensional feature spaces
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1999
Supporting ranked Boolean similarity queries in MARS
IEEE Transactions on Knowledge and Data Engineering, 1998