Bichromatic Reverse kNN Query Algorithm on Road Network Distance
A bichromatic reverse nearest neighbor (BRNN) query has been studied in a road network distance recently, however, existing works for BRNN query have shortcomings in the long processing time. In this paper, we propose a BRNN query algorithm in a road network distance by using the simple materialized path view (SMPV) data structure .
Unable to display preview. Download preview PDF.
- 1.Hlaing, A.T., Htoo, H., Ohsawa, Y., Sonehara, N., Sakauchi, M.: Shortest path finder with light materialized path view for location based services. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds.) WAIM 2013. LNCS, vol. 7923, pp. 229–234. Springer, Heidelberg (2013) CrossRefGoogle Scholar
- 3.Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. 29th VLDB, pp. 790–801 (2003)Google Scholar