Finding reverse nearest neighbors by region. (13th June 2013)

• Record Type: Journal Article
• Authors: Adhinugraha, Kiki Maulana; Taniar, David; Indrawan, Maria; Xhafa, Fatos; Chen, Xiaofeng; Huang, Xinyi; Kolici, Vladi
• Is Part Of: Concurrency and computation. Volume 26:Number 5(2014:Apr.)
• Page Start: 1142
• Page End: 1156
• Publication Date: 2013-06-13
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3056
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3056-abs-0001"> <title>SUMMARY</title> <p id="cpe3056-para-0001">Common reverse nearest neighbor queries in spatial database run in an inefficient way because they need to check a query result with almost every nearest neighbor. This wastes many time and resources, making this approach unsuitable for mobile computation. Instead of using the neighbors as candidates for the query result, a region approach can be used to answer the query. By using this approach, any objects located in the region will be considered candidate results for the query. To reduce the cost of creating the region, we introduce the concept of a contact zone, a method that can identify the right region generator points without having to process the whole points in the space, hence make reverse nearest neighbor queries by region possible to be run in mobile devices. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>