摘要
针对Top-k查询算法的缺陷，提出一种基于磁盘存储的NSDL调度算法，并将NSDL算法扩展为近似的Top-k查询算法———ANSDL。对NSDL算法和传统DG算法进行I/O开销比较实验，从实验结果来看，NSDL算法具有更高的查询效率和查询精度，而ANSDL算法则在一定的条件下进一步提高NSDL算法的查询效率。
Abstract
Top-k query algorithms for its high efficiency has been widely applied, but its efficiency with the increase in size of data, shows a larger decline. Aiming at the Top-k query algorithms defects, puts a NSDL scheduling algorithm based on disk storage, and the NSDL algo-rithms for Top-k query algorithms that approximate, ANSDL. Compares NSDL and traditional I/O overhead DG algorithm, judges from the results, NSDL algorithms with higher efficiency and precision, and ANSDL algorithms under certain conditions to further improve the NS-DL query efficiency.
NETL
NSTL
维普
万方数据