Affiliation:
1. IBM Almaden Research Center, San Jose, California
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fair&Share: Fast and Fair Multi-Criteria Selections;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21
2. SVQ-ACT: Querying for Actions over Videos;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04
3. Distance-based positive and unlabeled learning for ranking;Pattern Recognition;2023-02
4. Using Conjunctions for Faster Disjunctive Top-k Queries;Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining;2022-02-11
5. Ranked enumeration of join queries with projections;Proceedings of the VLDB Endowment;2022-01