Keyword-aware optimal route search

X Cao, L Chen, G Cong, X Xiao - arXiv preprint arXiv:1208.0077, 2012 - arxiv.org
Identifying a preferable route is an important problem that finds applications in map services.
When a user plans a trip within a city, the user may want to find" a most popular route such …

Group trip planning queries in spatial databases

T Hashem, T Hashem, ME Ali, L Kulik - Advances in Spatial and Temporal …, 2013 - Springer
Location-based social networks grow at a remarkable pace. Current location-aware mobile
devices enable us to access these networks from anywhere and to connect to friends via …

Optimal route search with the coverage of users' preferences

Y Zeng, X Chen, X Cao, S Qin… - … Joint Conference on …, 2015 - research.tees.ac.uk
The preferences of users are important in route search and planning. Users may also weight
their preferences differently. For example, when a user plans a trip within a city, their …

Efficient clue-based route search on road networks

B Zheng, H Su, W Hua, K Zheng… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
With the advances in geo-positioning technologies and location-based services, it is
nowadays quite common for road networks to have textual contents on the vertices. Previous …

Route search and planning: A survey

K Li, X Rao, XB Pang, L Chen, S Fan - Big data research, 2021 - Elsevier
Route search and planning have been playing an important role in spatial data
management and location-based social services. In this light, we conduct a survey on …

Optimal route queries with arbitrary order constraints

J Li, YD Yang, N Mamoulis - IEEE Transactions on Knowledge …, 2012 - ieeexplore.ieee.org
Given a set of spatial points DS, each of which is associated with categorical information, eg,
restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query …

Interactive route search in the presence of order constraints

Y Kanza, R Levin, E Safra, Y Sagiv - Proceedings of the VLDB …, 2010 - dl.acm.org
A route search is an enhancement of an ordinary geographic search. Instead of merely
returning a set of entities, the result is a route that goes via entities that are relevant to the …

Finding the minimum spatial keyword cover

DW Choi, J Pei, X Lin - 2016 IEEE 32nd International …, 2016 - ieeexplore.ieee.org
The existing works on spatial keyword search focus on finding a group of spatial objects
covering all the query keywords and minimizing the diameter of the group. However, we …

Efficient computation of trips with friends and families

T Hashem, S Barua, ME Ali, L Kulik… - Proceedings of the 24th …, 2015 - dl.acm.org
A group of friends located at their working places may want to plan a trip to visit a shopping
center, have dinner at a restaurant, watch a movie at a theater, and then finally return to their …

Personalized itinerary recommendation with time constraints using GPS datasets

YL Hsueh, HM Huang - Knowledge and information systems, 2019 - Springer
Planning a personalized itinerary for an unfamiliar region requires much effort to design
desirable travel plans. With the rapid development of location-based social network (LBSN) …