VAGUE: a user interface to relational databases that permits vague queries
ACM Transactions on Information Systems (TOIS)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Combining fuzzy information from multiple systems (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Supporting similarity queries in MARS
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Fuzzy queries in multimedia database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Query refinement for multimedia similarity retrieval in MARS
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Supporting Ranked Boolean Similarity Queries in MARS
IEEE Transactions on Knowledge and Data Engineering
MindReader: Querying Databases Through Multiple Examples
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
FALCON: Feedback Adaptive Loop for Content-Based Retrieval
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Query Reformulation for Content Based Multimedia Retrieval in MARS
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Efficient Query Refinement in Multimedia Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Relevance feedback: a power tool for interactive content-based image retrieval
IEEE Transactions on Circuits and Systems for Video Technology
Efficient evaluation of relevance feedback for multidimensional all-pairs retrieval
Proceedings of the 2003 ACM symposium on Applied computing
The PIBE personalizable image browsing engine
Proceedings of the 1st international workshop on Computer vision meets databases
An approximate algorithm for top-k closest pairs join query in large high dimensional data
Data & Knowledge Engineering
Efficient target search with relevance feedback for large CBIR systems
Proceedings of the 2006 ACM symposium on Applied computing
Adaptive rank-aware query optimization in relational databases
ACM Transactions on Database Systems (TODS)
Region clustering based evaluation of multiple top-N selection queries
Data & Knowledge Engineering
Handle local optimum traps in CBIR systems
Proceedings of the 2008 ACM symposium on Applied computing
Efficiently support concurrent queries in multiuser CBIR systems
Multimedia Tools and Applications
An academic information retrieval system based on multiagent framework
AIRS'06 Proceedings of the Third Asia conference on Information Retrieval Technology
Fast query point movement techniques with relevance feedback for content-based image retrieval
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Estimating recall and precision for vague queries in databases
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
ACM Transactions on Interactive Intelligent Systems (TiiS)
Hi-index | 0.00 |
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.