Please use this identifier to cite or link to this item:
|Title:||Keyword-aware optimal route search||Authors:||Cao, Xin
|Keywords:||Computer Science Engineering||Issue Date:||2012||Source:||Cao, X., Chen, L., Cong, G., & Xiao, X. (2012). Keyword-aware optimal route search. Proceedings of the VLDB Endowment, 5(11), 1136-1147.||Series/Report no.:||Proceedings of the VLDB Endowment||Abstract:||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 that it passes by shopping mall, restaurant, and pub, and the travel time to and from his hotel is within 4 hours." However, none of the algorithms in the existing work on route planning can be used to answer such queries. Motivated by this, we define the problem of keyword-aware optimal route query, denoted by KOR, which is to find an optimal route such that it covers a set of user-specified keywords, a specified budget constraint is satisfied, and an objective score of the route is optimal. The problem of answering KOR queries is NP-hard. We devise an approximation algorithm OSScaling with provable approximation bounds. Based on this algorithm, another more efficient approximation algorithm BucketBound is proposed. We also design a greedy approximation algorithm. Results of empirical studies show that all the proposed algorithms are capable of answering KOR queries efficiently, while the BucketBound and Greedy algorithms run faster. The empirical studies also offer insight into the accuracy of the proposed algorithms.||URI:||https://hdl.handle.net/10356/102238
|Rights:||© 2012 VLDB endowment.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Page view(s) 20475
Updated on Jan 24, 2021
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.