VAGUE: a user interface to relational databases that permits vague queries
ACM Transactions on Information Systems (TOIS)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
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
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
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Supporting Ranked Boolean Similarity Queries in MARS
IEEE Transactions on Knowledge and Data Engineering
An Approach to Integrating Query Refinement in SQL
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Query Optimization Strategies for Browsing Sessions
Proceedings of the Tenth International Conference on 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
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
Evaluating Refined Queries in Top-k Retrieval Systems
IEEE Transactions on Knowledge and Data Engineering
Relevance feedback: a power tool for interactive content-based image retrieval
IEEE Transactions on Circuits and Systems for Video Technology
An approximate algorithm for top-k closest pairs join query in large high dimensional data
Data & Knowledge Engineering
Estimating recall and precision for vague queries in databases
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
New retrieval applications support flexible comparison for all-pairs best match operations based on a notion of similarity or distance. The distance between items is determined by some arbitrary distance function. Users that pose queries may change their definition of the distance metric as they progress. The distance metric change may be explicit or implicit in an application (e.g., using relevance feedback). Recomputing from scratch the results with the new distance metric is wasteful. In this paper, we present an efficient approach to recomputing the all-pairs best match (join) operation using the new distance metric by re-using the work already carried out for the old distance metric. Our approach reduces significantly the work required to compute the new result, as compared to a naive re-evaluation.