skip to main content
10.1145/2996913.2996994acmotherconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
short-paper

k-Optimal meeting points based on preferred paths

Published:31 October 2016Publication History

ABSTRACT

In this paper, we investigate a novel query type for road networks, namely the k-Optimal Meeting Points based on Preferred paths (k-OMP3) query. Consider a group of friends currently at different places, e.g., their offices. Before going to their respective homes, using their own preferred paths in the underlying road network, the group is willing to meet at a restaurant for dinner. A k-OMP3 query would return the k restaurants that would minimize the group detour distance. In this short paper we present a provably correct approach which exploits the geometric properties of the problem in order to reduce the query's processing time. Our experiments, using real and synthetic data sets, confirm the effectiveness and efficiency of such approach.

References

  1. E. Ahmadi and M. A. Nascimento. A mixed breadth-depth first search strategy for sequenced group trip planning queries. In IEEE MDM, 2015, pages 24--33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Z. Chen, H. T. Shen, X. Zhou, and J. X. Yu. Monitoring path nearest neighbor in road networks. In ACM SIGMOD, 2009, pages 591--602. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. T. Hashem, S. Barua, M. E. Ali, L. Kulik, and E. Tanin. Efficient computation of trips with friends and families. In ACM CIKM, 2015, pages 931--940. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. H. Li, H. Lu, B. Huang, and Z. Huang. Two ellipse-based pruning methods for group nearest neighbor queries. In ACM GIS, 2005, pages 192--199. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Q. Lin, C. Xiao, M. Cheema, and W. Wang. Finding the sites with best accessibilities to amenities. In DASFAA, 2011, pages 58--72. Google ScholarGoogle ScholarCross RefCross Ref
  6. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group nearest neighbor queries. In IEEE ICDE, 2004, pages 301--312.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Shang, K. Deng, and K. Xie. Best point detour query in road networks. In ACM SIGSPATIAL, 2010, pages 71--80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Shekhar and J. S. Yoo. Processing in-route nearest neighbor queries: a comparison of alternative approaches. In ACM GIS, 2003, pages 9--16. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    SIGSPACIAL '16: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
    October 2016
    649 pages
    ISBN:9781450345897
    DOI:10.1145/2996913

    Copyright © 2016 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 31 October 2016

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • short-paper

    Acceptance Rates

    SIGSPACIAL '16 Paper Acceptance Rate40of216submissions,19%Overall Acceptance Rate220of1,116submissions,20%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader