Skip to main content
placeholder image

Spatio-temporal top-k term search over sliding window

Journal Article


Abstract


  • © 2018 Springer Science+Business Media, LLC, part of Springer Nature 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.

UOW Authors


  •   Chen, Lisi (external author)
  •   Shang, Shuo (external author)
  •   Yao, Bin (external author)
  •   Zheng, Kai (external author)

Publication Date


  • 2018

Citation


  • Chen, L., Shang, S., Yao, B. & Zheng, K. (2018). Spatio-temporal top-k term search over sliding window. World Wide Web, 1-18.

Scopus Eid


  • 2-s2.0-85048676307

Number Of Pages


  • 17

Start Page


  • 1

End Page


  • 18

Place Of Publication


  • United Kingdom

Abstract


  • © 2018 Springer Science+Business Media, LLC, part of Springer Nature 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.

UOW Authors


  •   Chen, Lisi (external author)
  •   Shang, Shuo (external author)
  •   Yao, Bin (external author)
  •   Zheng, Kai (external author)

Publication Date


  • 2018

Citation


  • Chen, L., Shang, S., Yao, B. & Zheng, K. (2018). Spatio-temporal top-k term search over sliding window. World Wide Web, 1-18.

Scopus Eid


  • 2-s2.0-85048676307

Number Of Pages


  • 17

Start Page


  • 1

End Page


  • 18

Place Of Publication


  • United Kingdom