FINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCH | Science Publications

Journal of Computer Science

Dr. S. Sridhar¹  K. Padmapriya¹ 

关键词: Nearest Neighbor Search;    R-Trees;    Local Priority Queue;    Global Priority Queue;   

DOI  :  10.3844/jcssp.2014.1045.1050

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

Nearest neighbor search is one of the most widely-used techniques and its applications including mobile communication, Geographic information systems, bioinformatics, computer vision and marketing. For example, four friends want to rent an apartment which should be nearer to their working places. Our paper discussed about the problems on finding the most appropriate location among a set of available places. The problem is defined as a top-k query which gives output of k points from a set of available places P along with the conveniences. We proposed algorithms based on R-trees to answer the query exactly. The efficiency of our proposed algorithms is verified through various experiments and found that it is better than existing algorithms use large scale real datasets.

【 授权许可】

Unknown