Abstract
Given a set of points Q on a road network G = (V,E), an optimal meeting point (OMP) query offers a point on a road network with the smallest sum-of-distances (SoD) to all the points in Q. For example, a travel agency may issue OMP query to decide the location for a tourist bus to pick up the tourists thus minimizing the total travel cost for tourist. The OMP problem has been well studied in the Euclidean space. The currently available algorithms for solving this problem in the context of road networks are still not efficient for the practical applications and are in-memory algorithms which do not guarantee the scalability for the large road databases. Further, the most of the research work has been carried out around the single point OMP; however, the k-OMP problem on the road network setting is still unexplored. In this paper, we are proposing multiple variants of the scalable external-memory based algorithms for computing the optimal meeting point. There are mainly three variants of the proposed grid based algorithms i.e. Basic Grid based, Hierarchical Grid based and Greedy Centroid based OMP search. Later we used single point OMP as a start point to explore the k points OMP using breadth first search. The I/O optimized spatial grids are loaded from the secondary storage as and when required and hence the I/O complexity is reduced to O(N/B) as opposed to O(N) in the existing methods; where B is the average number of road vertices of the grid block. Extensive experiments are conducted on both real and synthetic datasets.
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
Xiao, X., et al.: Optimal Location Queries in Road Network Databases. In: Proc. of the 2011 IEEE 27th International Conference on Data Engineering, Washington, DC, USA (2011)
Tiwari, S., Kaushik, S., Jagwani, P., Tiwari, S.: A Survey on LBS: System Architecture, Trends and Broad Research Areas. In: Kikuchi, S., Madaan, A., Sachdeva, S., Bhalla, S. (eds.) DNIS 2011. LNCS, vol. 7108, pp. 223–241. Springer, Heidelberg (2011)
Tiwari, S., et al.: Fusion of Navigation Technology and e-Learning Systems for On-The-Spot Learning. In: Proc. of ICWCA 2012, Kuala Lumpur, Malaysia (2012)
Choi, D.W., et al.: A Scalable Algorithm for Maximizing Range Sum in Spatial databases. In: Proceedings of the VLDB Endowment, 5th edn. Istanbul, Turkey (2012)
Da, Y.: Efficient Algorithms for Finding Optimal Meeting Point on Road Networks. PVLDB 4(11), 968–979 (2011)
Zuyun, W., et al.: A Quick Map-Matching Algorithm by Using Grid-Based Selecting. In: Proc. of IWGRS 2008, IEEE (2008), doi:978-0-7695-3563-0/08
Real Datasets for Spatial Databases: Road Networks and Points of Interest, http://www.cs.fsu.edu/~lifeifei/SpatialDataset.htm (last accessed on October 03, 2012)
Xu, Z., Jacobsen, H.: Processing Proximity Relations in Road Networks. In: SIGMOD, pp. 243–254 (2010)
Zhang, D., et al.: Progressive Computation of The MinDist Optimal-Location Query. In: VLDB 2006, Seoul, Korea (September 2006)
Du, Y.:: Optimal-location queries over spatial databases. Ph.D. thesis, College of Computer and Information Science, Northeastern University (2009)
Ghaemi, P., et al.: Optimal Network Location Queries. In: ACM GIS 2010, San Jose, CA, USA (November 2010)
Yan, D., et al.: Efficient Methods for Finding Influential Locations with Adaptive Grids. In: CIKM 2011, October 24–28, Glasgow, Scotland (2011)
Papadias, D., et al.: Group Nearest Neighbor Queries. In: ICDE, pp. 301–312 (2004)
Tiwari, S., et al.: Boundary Points Detection Using Adjacent Grid Block Selection (AGBS) kNN-Join Method. In: Proc. of MLDM/ICDM 2012, Berlin, Germany (2012)
Maperitive, http://maperitive.net/download/Maperitive-latest.zip (accessed on October 06, 2012)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer (1985)
GeoMidPoint - Random Point Generator with Maps, http://www.geomidpoint.com/random/ (last accessed October 5, 2012)
Rice, M., et al.: Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions. In: Proc. of the VLDB Endowment 2010, Seattle, Washington (2010)
Huang, J., et al.: Top-k Most Influential Location Selection. In: CIKM 2011, October 24–28, Glasgow, Scotland, UK (2011)
Lanthier, M., et al.: Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces. In: The Australasian Theory Symposium (CATS 2005), Newcastle, Australia. Conferences in Research and Practice in Information Technology, vol. 41 (2005)
Carpool, http://en.wikipedia.org/wiki/Carpool (last accessed on November 25, 2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tiwari, S., Kaushik, S. (2013). Scalable Method for k Optimal Meeting Points (k-OMP) Computation in the Road Network Databases. In: Madaan, A., Kikuchi, S., Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2013. Lecture Notes in Computer Science, vol 7813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37134-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-37134-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37133-2
Online ISBN: 978-3-642-37134-9
eBook Packages: Computer ScienceComputer Science (R0)