The Community for Technology Leaders
2018 IEEE 34th International Conference on Data Engineering (ICDE) (2018)
Paris, France
Apr 16, 2018 to Apr 19, 2018
ISSN: 2375-026X
ISBN: 978-1-5386-5520-7
pp: 1811-1812
ABSTRACT
The widespread location-aware applications produce a vast amount of spatio-textual data that contains both spatial and textual attributes. To make use of this enriched information for users to describe their preferences for travel routes, we propose a Bounded-Cost Informative Route (BCIR) query to retrieve the routes that are the most textually relevant to the user-specified query keywords subject to a travel cost constraint. BCIR query is particularly helpful for tourists and city explorers to plan their travel routes. We will show that BCIR query is an NP-hard problem. To answer BCIR query efficiently, we propose an exact solution with effective pruning techniques and an approximate solution with performance guarantee. Extensive experiments over real data sets demonstrate that the proposed solutions achieve the expected performance.
INDEX TERMS
computational complexity, mobile computing, query processing, text analysis
CITATION

W. Li, J. Cao, J. Guan, M. L. Yiu and S. Zhou, "Efficient Retrieval of Bounded-Cost Informative Routes," 2018 IEEE 34th International Conference on Data Engineering (ICDE), Paris, France, 2018, pp. 1811-1812.
doi:10.1109/ICDE.2018.00263
180 ms
(Ver 3.3 (11022016))