Batch Processing of Reverse k-Nearest Neighbor Queries for Moving Objects on Road Networks

This paper addresses the problem of efficiently processing multiple Reverse k-Nearest Neighbor (RkNN) queries simultaneously, a common scenario in location-based services. It introduces the BRkNN-Light algorithm, which leverages geometric constraints, optimized range search, and dynamic distance caching to minimize redundant computations when handling multiple queries in a batch. The focus on batch processing and computation reuse is a significant contribution, potentially leading to substantial performance improvements in real-world applications.