Database Paper Browser

Back to papers

Top-k Sorting Under Partial Order Information

Summary: Top-k sorting under partial orders with crowdsourced comparisons; minimizes expert workload. A dedicated top-k algorithm for PO, valid under two notions of the comparator, improving learning-to-rank with synthetic and real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5593
Venue
SIGMOD
Year
2018
Pagerank
5.8282325e-05
Overall Rank
4,918 | 65.79%
DOI
10.1145/3183713.3199672

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
7,535 Interactive Graph Search 2019 SIGMOD 4.7178467e-05
9,678 Interactive Graph Search for Multiple Targets on DAGs 2025 VLDB 4.3047774e-05
9,683 Hierarchical Entity Resolution using an Oracle 2022 SIGMOD 4.3047774e-05
9,684 How to Design Robust Algorithms using Noisy Comparison Oracle 2021 VLDB 4.3047774e-05
10,923 k-Clustering with Comparison and Distance Oracles 2024 PODS 4.1945683e-05
11,040 Robust Best Point Selection under Unreliable User Feedback 2024 VLDB 4.1945683e-05
11,507 TQEL: Framework for Query-Driven Linking of Top-K Entities in Social Media Blogs 2021 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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