Abstract
This paper proposes a bichromatic homogeneous vicinity query method and its efficient algorithm. Several query algorithms have been proposed individually including set k nearest neighbor (NN) query, ordered NN query, bichromatic reverse k NN query, and distance range query. When these types of queries are performed in the road network distance, all take long processing time. The algorithm proposed in this paper gives a unified procedure that can be applied to these queries with a different query condition for each, and it reduces the processing time drastically. The basic idea of the algorithm is to expand the region on the road network gradually while verifying the query condition. It is the most time consuming process, and to improve the deficiency in verification step, an efficient road network distance search method is proposed. Through extensive experiments, the proposed algorithm significantly improves the performance in terms of processing time by nearly two orders of magnitude.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ThaiTran, Q., Taniar, D., Safar, M.: Bichromatic reverse systems neighbor search in mobile systems. IEEE System Journal 4(2), 230–242 (2010)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations, Concepts and Applications of Voronoi Diagrams, 2nd edn. John Wiley & Sons (2000)
Kolahdouzan, M., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: Proc. 30th VLDB, pp. 840–851 (2004)
Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbor in large graphs. IEEE Transaction on Knowledge and Data Engineering 18(4), 1–14 (2006)
Cheema, M.A., Brankovic, L., Lin, X., Zhang, W., Wang, W.: Continuos monitoring of distance based range queries. IEEE Transactions on Knowledge and Data Engineering 23, 1182–1199 (2011)
Furuta, T., Suzuki, A., Inakawa, K.: The \(k\)th nearest network voronoi diagram and its application to districting problem of ambulance systems. Discussion Paper, No.0501, Center for Management Studies, Nanzan Universitys (2005)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numeriche Mathematik 1, 269–271 (1959)
Htoo, H., Ohsawa, Y., Sonehara, N., Sakauchi, M.: Incremental single-source multi target a* algorithm for lbs based on road network distance. IEICE Transactions on Information and Systems E96–D(5), 1043–1052 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ohsawa, Y., Htoo, H., Nyunt, N.J., Sein, M.M. (2015). Generalized Bichromatic Homogeneous Vicinity Query Algorithm in Road Network Distance. In: Morzy, T., Valduriez, P., Bellatreche, L. (eds) New Trends in Databases and Information Systems. ADBIS 2015. Communications in Computer and Information Science, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-319-23201-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-23201-0_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23200-3
Online ISBN: 978-3-319-23201-0
eBook Packages: Computer ScienceComputer Science (R0)