Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
4-2019
Abstract
With the emergence of smart phones and the popularity of GPS, the number of point of interest (POIs) is growing rapidly and spatial keyword search based on POIs has attracted significant attention. In this paper, we study a more sophistic type of spatial keyword searches that considers multiple query points and multiple query keywords, namely Aggregate Keyword Routing (AKR). AKR looks for an aggregate point m together with routes from each query point to m. The aggregate point has to satisfy the aggregate keywords, the routes from query points to the aggregate point have to pass POIs in order to complete the tasks specified by the task keywords, and the result route is expected to be the optimal one among all the potential results. In order to process AKR queries efficiently, we propose effective search algorithms, which support different aggregate functions. A comprehensive evaluation has been conducted to evaluate the performance of these algorithms with real datasets.
Keywords
Aggregate keyword query, Query processing, Route planning
Discipline
Databases and Information Systems | Theory and Algorithms
Research Areas
Data Science and Engineering
Publication
Database systems for advanced applications: 24th International Conference, DASFAA 2019, Chiang Mai, Thailand, April 22-25: Proceedings
Volume
11447
First Page
713
Last Page
729
ISBN
9783030185787
Identifier
10.1007/978-3-030-18579-4_42
Publisher
Springer
City or Country
Cham
Citation
JIANG, Qize; SUN, Weiwei; ZHENG, Baihua; and CHEN, Kunjie.
Efficient algorithms for solving aggregate keyword routing problems. (2019). Database systems for advanced applications: 24th International Conference, DASFAA 2019, Chiang Mai, Thailand, April 22-25: Proceedings. 11447, 713-729.
Available at: https://ink.library.smu.edu.sg/sis_research/4390
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/978-3-030-18579-4_42