DBScholar

Back to papers

Efficient Indexes for Diverse Top-k Range Queries

Summary: Studying top-k range queries that return diverse, high-weight points in R^d under bicriteria (trade-off value vs. diversity) and constrained (maximize value with diversity constraint) objectives; gives offline (0.5-ε)-approx algorithms. Proposes near-linear-size, near-linear-time-built indexes answering rectangle queries in O(k polylog n) with (0.5-ε)-approx; for constrained queries achieves 0.5^{O(d)}-approx or (1-ε)-approx if allowing ε expansion, same query time. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1830
Venue
PODS
Year
2020
Pagerank
5.3251649e-05
Overall Rank
9,073 | 37.76%
DOI
10.1145/3375395.3387667

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{agarwal_pods20,
        address = {New York, NY, USA},
        series = {{PODS} '20},
        title = {{Efficient Indexes for Diverse Top-k Range Queries}},
        url = {https://dl.acm.org/doi/10.1145/3375395.3387667},
        doi = {10.1145/3375395.3387667},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Agarwal, Pankaj K. and Sintos, Stavros and Steiger, Alex},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
8,728 Computing A Well-Representative Summary of Conjunctive Query Results 2024 PODS 5.3766157e-05
10,151 Coresets for Robust Query Optimization 2026 PODS 5.093636e-05
11,175 Faster Algorithms for Fair Max-Min Diversification in Rd 2024 SIGMOD 5.093636e-05
11,419 Equitable Top-k Results for Long Tail Data 2023 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers