چکیده (انگلیسی):

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.