An efficient framework for similarity query optimization

The increasing volume of multimedia data stored in relational database management systems (RDBMS) demands efficient ways to process similarity queries. Therefore, the query processor should provide mechanisms to express similarity queries, to interpret and translate them into equivalent expression in relational algebra, to evaluate alternative query plans and finally to execute the queries using the best plan found. In this paper, we present an effective framework to interpret, translate, select the best plan and efficiently execute similarity queries over data indexed by metric access methods. Experimental evaluation of the framework shows a reduction of up to 20% in the total time required to answer similarity queries.

[1]  Walid G. Aref,et al.  Optimization for Spatial Query Processing , 1991, Very Large Data Bases Conference.

[2]  V. S. Subrahmanian,et al.  A multi-similarity algebra , 1998, SIGMOD '98.

[3]  Agma J. M. Traina,et al.  MAMCost: Global and Local Estimates leading to Robust Cost Estimation of Similarity Queries , 2007, 19th International Conference on Scientific and Statistical Database Management (SSDBM 2007).

[4]  Christos Faloutsos,et al.  Efficient processing of complex similarity queries in RDBMS through query rewriting , 2006, CIKM '06.

[5]  Pavel Zezula,et al.  A cost model for similarity queries in metric spaces , 1998, PODS '98.

[6]  Agma J. M. Traina,et al.  SIREN: a similarity retrieval engine for complex data , 2006, VLDB.