DeepAI AI Chat
Log In Sign Up

Fairest Neighbors: Tradeoffs Between Metric Queries

by   Magnus Lie Hetland, et al.

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.


page 1

page 2

page 3

page 4


The Cascading Metric Tree

This paper presents the Cascaded Metric Tree (CMT) for efficient satisfa...

Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints

As research interest surges, vector similarity search is applied in mult...

Distributed processing of continuous range queries over moving objects

Monitoring range queries over moving objects is essential to extensive l...

Interactive Query Formulation using Query By Navigation

Effective information disclosure in the context of databases with a larg...

Efficient SPARQL Autocompletion via SPARQL

We show how to achieve fast autocompletion for SPARQL queries on very la...

Toward Metric Indexes for Incremental Insertion and Querying

In this work we explore the use of metric index structures, which accele...

Team DETR: Guide Queries as a Professional Team in Detection Transformers

Recent proposed DETR variants have made tremendous progress in various s...