• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (6): 59-64.

• 论文 • Previous Articles     Next Articles

A Reverse Dominant Point Set Based Algorithm for Top- k  Queries in DSMS

GAN Liang1,2,YU Lili3,LI Runheng1,JIA Yan1,JIN Xin4   

  1.  (1.School of Computer Science,National University of Defense Technology,Changsha 410073;
    2.Department Three,The Second Artillery Command College,Wuhan 430012;
    3.School of Computer Science and Engineering,Beihang University,Beijing 100191;
    4.Changsha Social Work College,Changsha  410004,China)
  • Received:2010-07-20 Revised:2011-02-15 Online:2012-06-25 Published:2012-06-25

Abstract:

Grid index is often used in the query of top k and skyline in DSMS, but it is coarsegrained. In this paper, we propose a  Reverse Dominant Point Set   ( RDPS )  algorithm which is based on grid index, and prune a number of cells in grid index using the characteristics of RDPS to improve the precision of top k queries, thus accessing the  data set in queries is limited to  the kmax calculating region . So, it reduces the memory usage of grid index and the overhead of queries. Analytical and experimental evidences show the efficiency of the proposed approaches.

Key words: preference topk queries;grid index;reserve dominant point set;data stream