2021/08/08 by Magnus Lie Hetland, Hetland, Magnus Lie, Halvard Hummel +1
Computer Science · #Advanced Database Systems and Queries #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge
paper · pdf · doi:10.48550/arxiv.2108.03621
openalex publication_date 2021/08/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Metric search commonly involves finding objects similar to a given sample object. We explore a generalization, where the desired result is a fair tradeoff between multiple query objects. This builds on previous results on complex queries, such as linear combinations. We instead use measures of inequality, like ordered weighted averages, and query existing index structures to find objects that minimize these. We compare our method empirically to linear scan and a post hoc combination of individual queries, and demonstrate a considerable speedup.