Combining fuzzy information from multiple systems (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
COOPIS '99 Proceedings of the Fourth IECIS International Conference on Cooperative Information Systems
| Hi-index | 0.00 |
This paper addresses the problem of retrieving query results by fuzzy association. Many works have studied applications that associate multiple objects by "fuzzy" (or "soft") conditions. For example, in heterogeneous data integration, similar name constants referring to the same entity are joined by the fuzzy notion of similarity, as they can differ in subtle ways (e.g., "Jane Smith" and "J. Smith"). Similarly, in spatial queries, two objects are joined by the fuzzy measure of the distance between the two. However, these works are specific solely to the specific target scenarios. This paper thus models representative access methods and formalizes this problem of supporting fuzzy associations in general, to unify existing applications of varying scenarios and even unstudied applications. Further, we propose optimal algorithms that uniformly apply to varying access methods across applications.