TY - JOUR
T1 - Spatio-temporal top-k term search over sliding window
AU - chen, Lisi
AU - Shang, Shuo
AU - Yao, Bin
AU - Zheng, Kai
N1 - KAUST Repository Item: Exported on 2021-02-19
PY - 2018/6/18
Y1 - 2018/6/18
N2 - In part due to the proliferation of GPS-equipped mobile devices, massive volumes of geo-tagged streaming text messages are becoming available on social media. It is of great interest to discover most frequent nearby terms from such tremendous stream data. In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k most frequent nearby terms over a sliding window. Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering term frequency, spatial proximity, and term freshness. We develop a novel and efficient mechanism to solve the problem, including a quad-tree based indexing structure, indexing update technique, and a best-first based searching algorithm. An empirical study is conducted to show that our proposed techniques are efficient and fit for users’ requirements through varying a number of parameters.
AB - In part due to the proliferation of GPS-equipped mobile devices, massive volumes of geo-tagged streaming text messages are becoming available on social media. It is of great interest to discover most frequent nearby terms from such tremendous stream data. In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k most frequent nearby terms over a sliding window. Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering term frequency, spatial proximity, and term freshness. We develop a novel and efficient mechanism to solve the problem, including a quad-tree based indexing structure, indexing update technique, and a best-first based searching algorithm. An empirical study is conducted to show that our proposed techniques are efficient and fit for users’ requirements through varying a number of parameters.
UR - http://hdl.handle.net/10754/628866
UR - http://link.springer.com/article/10.1007/s11280-018-0606-x
UR - http://www.scopus.com/inward/record.url?scp=85048676307&partnerID=8YFLogxK
U2 - 10.1007/s11280-018-0606-x
DO - 10.1007/s11280-018-0606-x
M3 - Article
AN - SCOPUS:85048676307
VL - 22
SP - 1953
EP - 1970
JO - World Wide Web
JF - World Wide Web
SN - 1386-145X
IS - 5
ER -