Research Article Open Access

FINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCH

K. Padmapriya1 and Dr. S. Sridhar1
  • 1 Sathyabama University, India

Abstract

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.

Journal of Computer Science
Volume 10 No. 6, 2014, 1045-1050

DOI: https://doi.org/10.3844/jcssp.2014.1045.1050

Submitted On: 12 November 2013 Published On: 1 February 2014

How to Cite: Padmapriya, K. & Sridhar, D. S. (2014). FINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCH. Journal of Computer Science, 10(6), 1045-1050. https://doi.org/10.3844/jcssp.2014.1045.1050

  • 3,086 Views
  • 2,353 Downloads
  • 0 Citations

Download

Keywords

  • Nearest Neighbor Search
  • R-Trees
  • Local Priority Queue
  • Global Priority Queue