Skip to main content
SpringerLink
Log in

Efficient processing of optimal meeting point queries in Euclidean space and road networks

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Finding an optimal meeting point (OMP) for a group of people (or a set of objects) at different locations is an important problem in spatial query processing. There are many real-life applications related to this problem, such as determining the location of a conference venue, deciding the pick-up location of a tourist bus, and planing tactics of artificial intelligence in real-time strategy games. Formally, given a set \(Q\) of query points in a spatial setting \(P\), an OMP query fetches the point \(o\in P\) that minimizes a cost function defined over the distances from \(o\) to all points in \(Q\). Since there are infinitely many locations in a given space setting, it is infeasible to examine all of them to find the OMP, and thus, the problem is challenging. In this paper, we study OMP queries in the following two spatial settings which are common in real-life applications: Euclidean space and road networks. In the setting of Euclidean space, we propose a general framework for answering all OMP query variants and also identify the best algorithms for particular types of OMP queries in the literature. In the setting of road networks, we study how to access only part of the road network and examine part of the candidates. Specifically, we explore two pruning techniques, namely Euclidean distance bound and threshold algorithm, which help improve the efficiency of OMP query processing. Extensive experiments are conducted to demonstrate the efficiency of our proposed approaches on both real and synthetic datasets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. http://us.blizzard.com/en-us/games/war3/.

  2. Note that the pseudo-code on Page 478 of Alsuwaiyel [1] is incorrect unless “\(A\leftarrow A\cup \{(p_i, p_j)\}\)” is added between Lines 13 and 14.

  3. http://cta.ornl.gov/transnet/.

References

  1. Alsuwaiyel MH (1999) Algorithms: design techniques and analysis. World Scientific, Singapore

    MATH  Google Scholar 

  2. Beck A, Teboulle M (2009) Gradient-based algorithms with applications to signal recovery. In: Palomar D, Eldar Y (eds) Convex optimization in signal processing and communications. Cambridge University Press, Cambridge, pp 139–162

  3. Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  4. Brimberg J, Love RF (1993) Global convergence of a generalized iterative procedure for the minisum location problem with lp distances. Oper Res 41(6):1153–1163

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen R (1984) Location problems with costs being sums of powers of Euclidean distances. Comput Oper Res 11(3):285–294

    Google Scholar 

  6. Chen R (1984) Solution of location problems with radial cost functions. Comput Math Appl 10(1):87–94

    Google Scholar 

  7. Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32(5):1338–1355

    Article  MATH  MathSciNet  Google Scholar 

  8. Cooper L (1968) An extension of the generalized weber problem. J Reg Sci 8(2):181–197

    Article  Google Scholar 

  9. De Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry. Springer, Berlin

    Book  MATH  Google Scholar 

  10. Deng K, Sadiq S, Zhou X, Xu H, Fung GPC, Lu Y (2012) On group nearest group query processing. IEEE Trans Knowl Data Eng 24(2):295–308

    Article  Google Scholar 

  11. Drezner Z, Shelah S (1987) On the complexity of the Elzinga-Hearn algorithm for the 1-center problem. Math Oper Res 12(2):255–261

    Article  MATH  MathSciNet  Google Scholar 

  12. Du Y, Zhang D, Xia T (2005) The optimal-location query. Advances in spatial and temporal databases. Springer, Berlin

    Google Scholar 

  13. Fagin R, Lotem A, Naor M (2003) Optimal aggregation algorithms for middleware. J Comput Syst Sci 66(4):614–656

    Article  MATH  MathSciNet  Google Scholar 

  14. Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: faster and simpler hierarchical routing in road networks. Experimental algorithms. Springer, Berlin, pp 319–333

    Google Scholar 

  15. Kellaris G, Mouratidis K (2010) Shortest path computation on air indexes. Proc VLDB Endow 3(1–2):747–757

    Article  Google Scholar 

  16. Leutenegger ST, Lopez MA, Edgington J (1997) STR: a simple and efficient algorithm for R-tree packing. In: IEEE 13th international conference on data engineering (ICDE), April 1997, pp 497–506

  17. Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. Advances in spatial and temporal databases. Springer, Berlin, pp 273–290

    Book  Google Scholar 

  18. Li F, Yao B, Kumar P (2011) Group enclosing queries. IEEE Trans Knowl Data Eng 23(10):1526–1540

    Google Scholar 

  19. Li Y, Li F, Yi K, Yao B, Wang M (2011) Flexible aggregate similarity search. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, June 2011, pp 1009–1020

  20. Li J, Yiu ML, Mamoulis N (2013) Efficient notification of meeting points for moving groups via independent safe regions. In: IEEE 29th international conference on data engineering (ICDE), 2013, pp 422–433

  21. Lian X, Chen L (2008) Probabilistic group nearest neighbor queries in uncertain databases. IEEE Trans Knowl Data Eng 20(6):809–824

    Article  Google Scholar 

  22. Megiddo N (1982) Linear-time algorithms for linear programming in R3 and related problems. In: Proceedings of 23rd annual IEEE symposium on foundations of computer science, November 1982, pp 329–338

  23. Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the 29th international conference on very large data bases, Volume 29. VLDB Endowment, Sept 2003, pp 802–813

  24. Ostresh LM (1977) The multifacility location problem: applications and descent theorems. J Reg Sci 17(3):409–419

    Article  Google Scholar 

  25. Papadias D, Shen Q, Tao Y, Mouratidis K Group nearest neighbor queries. In: IEEE 20th international conference on data engineering (ICDE), March 2004, pp 301–312

  26. Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. ACM Trans Database Syst (TODS) 30(2):529–576

    Article  Google Scholar 

  27. Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, June 2008, pp 43–54

  28. Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. Proc VLDB Endow 2(1):1210–1221

    Article  Google Scholar 

  29. Shamos MI, Hoey D (1975) Closest point problems. In: Proceedings of 16th annual IEEE symposium on foundations of computer science, Oct 1975, pp 151–162

  30. Shekhar S, Liu DR (1997) CCAM: a connectivity-clustered access method for networks and network computations. IEEE Trans Knowl Data Eng 9(1):102–119

    Article  Google Scholar 

  31. Tao Y, Sheng C, Pei J (2011) On \(k\)-skip shortest paths. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, June 2011, pp 421–432

  32. Wesolowsky GO (1982) Location problems on a sphere. Reg Sci Urban Econ 12(4):495–508

    Article  Google Scholar 

  33. Wong RCW, Özsu MT, Yu PS, Fu AWC, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. Proc VLDB Endow 2(1):1126–1137

    Article  Google Scholar 

  34. Xiao X, Yao B, Li F (2011) Optimal location queries in road network databases. In: IEEE 27th international conference on data engineering (ICDE), April 2011, pp 804–815

  35. Xu Z, Jacobsen HA (2010) Processing proximity relations in road networks. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, June 2010, pp 243–254

  36. Yan D, Zhao Z, Ng W (2011) Efficient algorithms for finding optimal meeting point on road networks. Proce VLDB Endow 4(11):968–979

    Google Scholar 

  37. Yan D, Wong RCW, Ng W (2011) Efficient methods for finding influential locations with adaptive grids. In: Proceedings of the 20th ACM international conference on Information and knowledge management, Oct 2011, pp 1475–1484

  38. Yan D, Cheng J, Ng W, Liu S (2013) Finding distance-preserving subgraphs in large road networks. In: IEEE 29th international conference on data engineering (ICDE), 2013, pp 625–636

  39. Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. IEEE Trans Knowl Data Eng 17(6):820–833

    Article  Google Scholar 

Download references

Acknowledgments

This work is partially supported by GRF under Grant Numbers HKUST 617610.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

    Da Yan, Zhou Zhao & Wilfred Ng

Authors
  1. Da Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhou Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wilfred Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Da Yan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yan, D., Zhao, Z. & Ng, W. Efficient processing of optimal meeting point queries in Euclidean space and road networks. Knowl Inf Syst 42, 319–351 (2015). https://doi.org/10.1007/s10115-013-0686-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-013-0686-y

Keywords

Search

Navigation