This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Evaluating Refined Queries in Top-k Retrieval Systems
February 2004 (vol. 16 no. 2)
pp. 256-270

Abstract—In many applications, users specify target values for certain attributes/features without requiring exact matches to these values in return. Instead, the result is typically a ranked list of “top k” objects that best match the specified feature values. User subjectivity is an important aspect of such queries, i.e., which objects are relevant to the user and which are not depends on the perception of the user. Due to the subjective nature of top-k queries, the answers returned by the system to an user query often do not satisfy the users need right away, either because the weights and the distance functions associated with the features do not accurately capture the users perception or because the specified target values do not fully capture her information need or both. In such cases, the user would like to refine the query and resubmit it in order to get back a better set of answers. While there has been a lot of research on query refinement models, there is no work that we are aware of on supporting refinement of top-k queries efficiently in a database system. Done naively, each “refined” query can be treated as a “starting” query and evaluated from scratch. This paper explores alternative approaches that significantly improve the cost of evaluating refined queries by exploiting the observation that the refined queries are not modified drastically from one iteration to another. Our experiments over a real-life multimedia data set show that the proposed techniques save more than 80 percent of the execution cost of refined queries over the naive approach and is more than an order of magnitude faster than a simple sequential scan.

[1] M. Carey and D. Kossmann, On Saying Enough Already in Sql Proc. SIGMOD, 1997.
[2] K. Chakrabarti and S. Mehrotra, The Hybrid Tree: An Index Structure for High-Dimensional Feature Spaces Proc. Int'l Conf. Data Eng., pp. 440-447, 1999.
[3] K. Chakrabarti, K. Porkaew, and S. Mehrotra, “Efficient Query Refinement in Multimedia Databases,” Proc. Int'l Conf. Data Eng., 2000.
[4] K. Chakrabarti, K. Porkaew, and S. Mehrotra, “Efficient Query Refinement in Multimedia Databases,” Proc. Int'l Conf. Data Eng., 2000.
[5] S. Chaudhari and L. Gravano, Evaluating Top-k Selection Queries Proc. Very Large Data Bases Conf., 1999.
[6] R. Fagin, Combining Fuzzy Information from Multiple Systems Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.
[7] R. Fagin, Fuzzy Queries in Multimedia Database Systems Proc. Symp. Principles of Database Systems (PODS), 1998.
[8] J. Gray and A. Reuter, Transactions Processing: Concepts and Techniques. San Mateo, Calif.: Morgan Kaufmann, 1993.
[9] J. Gray and P. Shenoy, Rules of Thumb in Data Engineering http://www.research.microsoft.comgray, 1999.
[10] G.R. Hjaltason and H. Samet, Ranking in Spatial Databases Proc. Int'l Conf. Stochastic Structural Dynamics (SSD), 1995.
[11] Y. Ishikawa, R. Subramanya, and C. Faloutsos, Mindreader: Querying Databases through Multiple Examples Proc. Very Large Data Bases Conf., 1998.
[12] F. Korn, N. Sidiropoulos, and C. Faloutsos, Fast Nearest Neighbor Search in Medical Image Databases Proc. Very Large Data Bases Conf., 1996.
[13] A. Motro, Vague: A User Interface to Relational Databases that Permits Vague Queries ACM Trans. Office Information Systems, vol. 6, no. 3, July 1988.
[14] S. Nepal and M.V. Ramakrishna, Query Processing Issues in Image (Multimedia) Databases Proc. Int'l Conf. Data Eng., pp. 22-29, 1999.
[15] W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, and P. Yanker, The QBIC Project: Querying Images by Content Using Color, Texture and Shape Proc. SPIE Conf. Storage and Retrieval for Image and Video Databases, Feb. 1993.
[16] M. Ortega, Y. Rui, K. Chakrabarti, S. Mehrotra, and T. Huang, Supporting Similarity Queries in Mars Proc. ACM Multimedia 1997, 1997.
[17] M. Ortega, Y. Rui, K. Chakrabarti, K. Porkaew, S. Mehrotra, and T.S. Huang, Supporting Ranked Boolean Similarity Queries in MARS IEEE Trans. Knowledge and Data Eng., vol. 10, no. 6, pp. 905-925, Nov./Dec. 1998.
[18] K. Porkaew, K. Chakrabarti, and S. Mehrotra, Query Refinement for Content-Based Multimedia Retrieval in MARS Proc. ACM Multimedia Conf., 1999.
[19] K. Porkaew, K. Chakrabarti, and S. Mehrotra, Query Refinement for Content-Based Multimedia Retrieval in MARS Proc. ACM Multimedia Conf., 1999.
[20] K. Porkaew, S. Mehrotra, M. Ortega, and K. Chakrabarti, Similarity Search Using Multiple Examples in MARS Proc. Int'l Conf. Visual Information Systems, 1999.
[21] N. Roussopoulos, S. Kelley, and F. Vincent, Nearest Neighbor Queries Proc. SIGMOD, 1995.
[22] Y. Rui, T.S. Huang, and S. Mehrotra, "Content-Based Image Retrieval with Relevance Feedback in MARS," Proc. IEEE ICIP Int'l Conf. Image Processing, 1997.
[23] Y. Rui, T. Huang, and S. Mehrotra, Relevance Feedback Techniques in Interactive Content-Based Image Retrieval Proc. IS&T and SPIE Storage and Retrieval of Image and Video Databases, 1998.
[24] Y. Rui, T.S. Huang, M. Ortega, and S. Mehrotra, “Relevance Feednack: A Power Tool for Interactive Conten-Based Image Retrieval,” IEEE Trans. Circuits, and Video Technology, Sept. 1998.
[25] T. Seidl and H. Kriegel, Efficient User-Adaptable Similarity Search in Large Multimedia Databases Proc. Very Large Data Bases Conf., 1997.
[26] T. Seidl and H. Kriegel, Optimal Multistep k-Nearest Neighbor Search Proc. ACM SIGMOD, 1998.
[27] D. White and R. Jain, Algorithms and Strategies for Similarity Retrieval, 1996.
[28] L. Wu, C. Faloutsos, K. Sycara, and T. Payne, Falcon: Feedback Adaptive Loop for Content-Based Retrieval Proc. Very Large Data Bases Conf., 2000.

Index Terms:
Multidimensional indexing, k-nearest neighbor search, similarity queries, query refinement, relevance feedback.
Citation:
Kaushik Chakrabarti, Michael Ortega-Binderberger, Sharad Mehrotra, Kriengkrai Porkaew, "Evaluating Refined Queries in Top-k Retrieval Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 2, pp. 256-270, Feb. 2004, doi:10.1109/TKDE.2004.1269602
Usage of this product signifies your acceptance of the Terms of Use.