Ap-tree: Efficiently support continuous spatial-keyword queries over stream

X Wang, Y Zhang, W Zhang, X Lin… - 2015 IEEE 31st …, 2015 - ieeexplore.ieee.org
We investigate the problem of processing a large amount of continuous spatial-keyword
queries over streaming data, which is essential in many applications such as location-based …

Be-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space

M Sadoghi, HA Jacobsen - Proceedings of the 2011 ACM SIGMOD …, 2011 - dl.acm.org
BE-Tree is a novel dynamic tree data structure designed to efficiently index Boolean
expressions over a high-dimensional discrete space. BE-Tree copes with both high …

Skype: Top-k spatial-keyword publish/subscribe over sliding window

X Wang, Y Zhang, W Zhang, X Lin… - Proceedings of the VLDB …, 2016 - dl.acm.org
As the prevalence of social media and GPS-enabled devices, a massive amount of geo-
textual data has been generated in a stream fashion, leading to a variety of applications …

Location-aware pub/sub system: When continuous moving queries meet dynamic event streams

L Guo, D Zhang, G Li, KL Tan, Z Bao - Proceedings of the 2015 ACM …, 2015 - dl.acm.org
In this paper, we propose a new location-aware pub/sub system, Elaps, that continuously
monitors moving users subscribing to dynamic event streams from social media and E …

E-tree: An efficient indexing structure for ensemble models on data streams

P Zhang, C Zhou, P Wang, BJ Gao… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
Ensemble learning is a common tool for data stream classification, mainly because of its
inherent advantages of handling large volumes of stream data and concept drifting. Previous …

Evaluation strategies for top-k queries over memory-resident inverted indexes

M Fontoura, V Josifovski, J Liu, S Venkatesan… - Proceedings of the …, 2011 - dl.acm.org
Top-k retrieval over main-memory inverted indexes is at the core of many modern
applications: from large scale web search and advertising platforms, to text extenders and …

An efficient publish/subscribe index for e-commerce databases

D Zhang, CY Chan, KL Tan - Proceedings of the VLDB Endowment, 2014 - dl.acm.org
Many of today's publish/subscribe (pub/sub) systems have been designed to cope with a
large volume of subscriptions and high event arrival rate (velocity). However, in many novel …

Rein: A fast event matching approach for content-based publish/subscribe systems

S Qian, J Cao, Y Zhu, M Li - IEEE INFOCOM 2014-IEEE …, 2014 - ieeexplore.ieee.org
Event matching is the process of checking high volumes of events against large numbers of
subscriptions and is a fundamental issue for the overall performance of a large-scale …

Cluster-based subscription matching for geo-textual data streams

L Chen, S Shang, K Zheng… - 2019 IEEE 35th …, 2019 - ieeexplore.ieee.org
Geo-textual data that contain spatial, textual, and temporal information are being generated
at a very high rate. These geo-textual data cover a wide range of topics. Users may be …

Top-k spatial-keyword publish/subscribe over sliding window

X Wang, W Zhang, Y Zhang, X Lin, Z Huang - The VLDB Journal, 2017 - Springer
With the prevalence of social media and GPS-enabled devices, a massive amount of geo-
textual data have been generated in a stream fashion, leading to a variety of applications …