返回
Efficient Top-k Retrieval on Massive Data
DOI:10.1109/TKDE.2015.2426691.png)
摘要
En 中文
In many applications, top-k query is an important operation to return a set of interesting points in a potentially huge data space. It is analyzed in this paper that the existing algorithms cannot process top-k query on massive data efficiently. This paper proposes a novel table-scan-based T2S algorithm to efficiently compute top-k results on massive data. T2S first constructs the presorted table, whose tuples are arranged in the order of the round-robin retrieval on the sorted lists. T2S maintains only fixed number of tuples to compute results. The early termination checking for T2S is presented in this paper, along with the analysis of scan depth. The selective retrieval is devised to skip the tuples in the presorted table which are not top-k results. The theoretical analysis proves that selective retrieval can reduce the number of the retrieved tuples significantly. The construction and incremental-update/batch-processing methods for the used structures are proposed in this paper. The extensive experimental results, conducted on synthetic and real-life data sets, show that T2S has a significant advantage over the existing algorithms.
Keyword:
Massive data
T2S algorithm
table scan
early termination
selective retrieval
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
DsrR, a Novel IscA-Like Protein Lacking Iron- and Fe-S-Binding Functions, Involved in the Regulation of Sulfur Oxidation inAllochromatium vinosumDsrR,一种缺乏铁和fe-s结合功能的新型IscA样蛋白,参与 Allochromatium vinosum 中硫氧化的调节

