TY - JOUR
T1 - Searching activity trajectory with keywords
AU - Zheng, Bolong
AU - Zheng, Kai
AU - Scheuermann, Peter
AU - Zhou, Xiaofang
AU - Nguyen, Quoc Viet Hung
AU - Li, Chenliang
N1 - Funding Information:
Acknowledgements This work is supported by the National Natural Science Foundation of China (Grant No. 61502324, Grant No. 61532018, Grant No. 61572335).
Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/5/15
Y1 - 2019/5/15
N2 - Driven by the advances in location positioning techniques and the popularity of location sharing services, semantic enriched trajectory data has become unprecedentedly available. While finding relevant Point-of-Interests (PoIs) based on users’ locations and query keywords has been extensively studied in the past years, it is, however, largely untouched to explore the keyword queries in the context of activity trajectory database. In this paper, we study the problem of searching activity trajectories by keywords. Given a set of query keywords, a keyword-oriented query for activity trajectory (KOAT) returns k trajectories that contain the most relevant keywords to the query and yield the least travel effort in the meantime. The main difference between KOAT and conventional spatial keyword queries is that there is no query location in KOAT, which means the search area cannot be localized. To capture the travel effort in the context of query keywords, a novel score function, called spatio-textual ranking function, is first defined. Then we develop a hybrid index structure called GiKi to organize the trajectories hierarchically, which enables pruning the search space by spatial and textual similarity simultaneously. Finally an efficient search algorithm and fast evaluation of the value of spatio-textual ranking function are proposed. In addition, we extend the proposed techniques of KOAT to support range-based query and order sensitive query, which can be applied for more practical applications. The results of our empirical studies based on real check-in datasets demonstrate that our proposed index and algorithms can achieve good scalability.
AB - Driven by the advances in location positioning techniques and the popularity of location sharing services, semantic enriched trajectory data has become unprecedentedly available. While finding relevant Point-of-Interests (PoIs) based on users’ locations and query keywords has been extensively studied in the past years, it is, however, largely untouched to explore the keyword queries in the context of activity trajectory database. In this paper, we study the problem of searching activity trajectories by keywords. Given a set of query keywords, a keyword-oriented query for activity trajectory (KOAT) returns k trajectories that contain the most relevant keywords to the query and yield the least travel effort in the meantime. The main difference between KOAT and conventional spatial keyword queries is that there is no query location in KOAT, which means the search area cannot be localized. To capture the travel effort in the context of query keywords, a novel score function, called spatio-textual ranking function, is first defined. Then we develop a hybrid index structure called GiKi to organize the trajectories hierarchically, which enables pruning the search space by spatial and textual similarity simultaneously. Finally an efficient search algorithm and fast evaluation of the value of spatio-textual ranking function are proposed. In addition, we extend the proposed techniques of KOAT to support range-based query and order sensitive query, which can be applied for more practical applications. The results of our empirical studies based on real check-in datasets demonstrate that our proposed index and algorithms can achieve good scalability.
KW - Activity trajectory
KW - Query processing
KW - Spatial keyword query
UR - http://www.scopus.com/inward/record.url?scp=85043706462&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85043706462&partnerID=8YFLogxK
U2 - 10.1007/s11280-018-0535-8
DO - 10.1007/s11280-018-0535-8
M3 - Article
AN - SCOPUS:85043706462
SN - 1386-145X
VL - 22
SP - 967
EP - 1000
JO - World Wide Web
JF - World Wide Web
IS - 3
ER -