Name
Abstract | ||
|---|---|---|
Many data exploration applications require the ability to identify the top-k results according to a scoring function. We study a class of top-k ranking problems where top-k candidates in a dataset are scored with the assistance of another set. We call this class of workloads cross aggregate ranking. Example computation problems include evaluating the Hausdorff distance between two datasets, findin... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TSC.2016.2586062 | IEEE Transactions on Services Computing |
Keywords | Field | DocType |
Aggregates,Scheduling,Entropy,Query processing,Processor scheduling,Uncertainty,Indexes | Data mining,Ranking,Result set,Fair-share scheduling,Scheduling (computing),Computer science,Theoretical computer science,Hausdorff distance,Dynamic priority scheduling,Round-robin scheduling,Medoid | Journal |
Volume | Issue | ISSN |
11 | 3 | 1939-1374 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengcheng Dai | 1 | 0 | 0.34 |
| Sarana Nutanong | 2 | 290 | 25.55 |
| Chi-Yin Chow | 3 | 2077 | 91.47 |
| Reynold Cheng | 4 | 3069 | 154.13 |