TY - JOUR
T1 - Approximate spatio-temporal top-k publish/subscribe
AU - Chen, Lisi
AU - Shang, Shuo
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2018/4/26
Y1 - 2018/4/26
N2 - Location-based publish/subscribe plays a significant role in mobile information disseminations. In this light, we propose and study a novel problem of processing location-based top-k subscriptions over spatio-temporal data streams. We define a new type of approximate location-based top-k subscription, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription, that continuously feeds users with relevant spatio-temporal messages by considering textual similarity, spatial proximity, and information freshness. Different from existing location-based top-k subscriptions, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription can automatically adjust the triggering condition by taking the triggering score of other subscriptions into account. The group filtering efficacy can be substantially improved by sacrificing the publishing result quality with a bounded guarantee. We conduct extensive experiments on two real datasets to demonstrate the performance of the developed solutions.
AB - Location-based publish/subscribe plays a significant role in mobile information disseminations. In this light, we propose and study a novel problem of processing location-based top-k subscriptions over spatio-temporal data streams. We define a new type of approximate location-based top-k subscription, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription, that continuously feeds users with relevant spatio-temporal messages by considering textual similarity, spatial proximity, and information freshness. Different from existing location-based top-k subscriptions, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription can automatically adjust the triggering condition by taking the triggering score of other subscriptions into account. The group filtering efficacy can be substantially improved by sacrificing the publishing result quality with a bounded guarantee. We conduct extensive experiments on two real datasets to demonstrate the performance of the developed solutions.
UR - http://hdl.handle.net/10754/627737
UR - http://link.springer.com/article/10.1007/s11280-018-0564-3
UR - http://www.scopus.com/inward/record.url?scp=85045950363&partnerID=8YFLogxK
U2 - 10.1007/s11280-018-0564-3
DO - 10.1007/s11280-018-0564-3
M3 - Article
SN - 1386-145X
VL - 22
SP - 2153
EP - 2175
JO - World Wide Web
JF - World Wide Web
IS - 5
ER -