Top-k diversity queries over bounded regions

DOI10.1145/2487259.2487262zbMATH Open1321.68251OpenAlexW2113952707MaRDI QIDQ2943536FDOQ2943536

Authors: Ilio Catallo, Eleonora Ciceri, Piero Fraternali, Davide Martinenghi, M. Tagliasacchi 

Publication date: 3 September 2015

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2487259.2487262

Recommendations

• Approximate distributed top-\(k\) queries
• Top-\(k\) vectorial aggregation queries in a distributed environment
• Efficient top-\(k\) queries for orthogonal ranges
• Encodings for range selection and top-\(k\) queries

zbMATH Keywords

aggregationrankingscoringdiversificationtop-\(k\)

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Distributed algorithms (68W15) Internet topics (68M11)

Cited In (6)

• Diversity and freshness-aware regret minimizing set queries
• On the complexity of query result diversification
• Top-\(k\) spatial preference query for group nearest neighbor
• Modelling efficient novelty-based search result diversification in metric spaces
• Title not available (Why is that?)
• Towards strong regret minimization sets: balancing freshness and diversity in data selection

This page was built for publication: Top-k diversity queries over bounded regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943536)