Name
Abstract | ||
|---|---|---|
In many applications, top-k query is an important operation to return a set of interesting points in a potentially huge data space. The existing algorithms, either maintaining too many candidates, or requiring assistant structures built on the specific attribute subset, or returning results with probabilistic guarantee, cannot process top-k query on massive data efficiently. This paper proposes a sorted-list-based TKAP algorithm, which utilizes some data structures of low space overhead, to efficiently compute top-k results on massive data. In round-robin retrieval on sorted lists, TKAP performs adaptive pruning operation and maintains the required candidates until the stop condition is satisfied. The adaptive pruning operation can be adjusted by the information obtained in round-robin retrieval to achieve a better pruning effect. The adaptive pruning rule is developed in this paper, along with its theoretical analysis. The extensive experimental results, conducted on synthetic and real-life data sets, show the significant advantage of TKAP over the existing algorithms. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10115-015-0836-5 | Knowledge and Information Systems |
Keywords | Field | DocType |
Massive data, TKAP algorithm, Sorted list, Adaptive pruning | Data mining,Data structure,Data space,Data set,Computer science,Principal variation search,Pruning (decision trees),Artificial intelligence,Probabilistic logic,Machine learning,Pruning | Journal |
Volume | Issue | ISSN |
47 | 2 | 0219-3116 |
Citations | PageRank | References |
3 | 0.39 | 22 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xixian Han | 1 | 78 | 10.45 |
| Xianmin Liu | 2 | 12 | 5.00 |
| Jianzhong Li | 3 | 3196 | 304.46 |
| Hong Gao | 4 | 1086 | 120.07 |