Combining fuzzy information: an overview

ABSTRACT

Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). Each object is assigned an overall grade, that is obtained by combining the attribute grades using a fixed monotone aggregation function, or combining rule, such as min or average. In this overview, we discuss and compare algorithms for determining the top k objects, that is, k objects with the highest overall grades.

REFERENCES

• 1: Amelie Marian, Evaluating Top-k Queries over Web-Accessible Databases, Proceedings of the 18th International Conference on Data Engineering, p.369, February 26-March 01, 2002
• 2: Surajit Chaudhuri , Luis Gravano, Optimizing queries over multimedia repositories, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.91-102, June 04-06, 1996, Montreal, Quebec, Canada
• 3: Ronald Fagin, Combining fuzzy information from multiple systems, Journal of Computer and System Sciences, v.58 n.1, p.83-99, Feb. 1999 [doi>10.1006/jcss.1998.1600]
• 4: Ronald Fagin , Amnon Lotem , Moni Naor, Optimal aggregation algorithms for middleware, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.102-113, May 2001, Santa Barbara, California, United States [doi>10.1145/375551.375567]
• 5: Ulrich Güntzer , Wolf-Tilo Balke , Werner Kießling, Optimizing Multi-Feature Queries for Image Databases, Proceedings of the 26th International Conference on Very Large Data Bases, p.419-428, September 10-14, 2000
• 6: Towards Efficient Multi-Feature Queries in Heterogeneous Environments, Proceedings of the International Conference on Information Technology: Coding and Computing, p.622, April 02-04, 2001
• 7: {NBE+93} 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. In SPIE Conference on Storage and Retrieval for Image and Video Databases, volume 1908, pages 173-187, 1993. QBIC Web server is http://wwwqbic.almaden.ibm.com/.
• 8: Apostol Natsev , Yuan-Chi Chang , John R. Smith , Chung-Sheng Li , Jeffrey Scott Vitter, Supporting Incremental Join Queries on Ranked Inputs, Proceedings of the 27th International Conference on Very Large Data Bases, p.281-290, September 11-14, 2001
• 9: Query Processing Issues in Image(Multimedia) Databases, Proceedings of the 15th International Conference on Data Engineering, p.22, March 23-26, 1999
• 10: Edward L. Wimmers , Laura M. Haas , Mary Tork Roth , Christoph Braendli, Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware, Proceedings of the Fourth IECIS International Conference on Cooperative Information Systems, p.267, September 02-04, 1999
• 11: {Zad69} L. A. Zadeh. Fuzzy sets. Information and Control, 8:338-353, 1969.
• 12: {Zim96} H. J. Zimmermann. Fuzzy Set Theory. Kluwer Academic Publishers, Boston, 3rd edition, 1996.