Personalized information delivery: an analysis of information filtering methods
Communications of the ACM - Special issue on information filtering
Index structures for selective dissemination of information under the Boolean model
ACM Transactions on Database Systems (TODS)
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Duplicate Removal in Information System Dissemination
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Self-Adaptive User Profiles for Large-Scale Data Delivery
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Keyword Search in Spatial Databases: Towards Searching by Document
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Collective spatial keyword querying
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient continuously moving top-k spatial keyword query processing
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Efficient processing of top-k spatial keyword queries
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Efficient Evaluation of Continuous Text Search Queries
IEEE Transactions on Knowledge and Data Engineering
Text vs. space: efficient geo-search query processing
Proceedings of the 20th ACM international conference on Information and knowledge management
Spatio-textual indexing for geographical search on the web
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
SWST: A Disk Based Index for Sliding Window Spatio-Temporal Data
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Hi-index | 0.00 |
Massive amount of data that are geo-tagged and associated with text information are being generated at an unprecedented scale. Users may want to be notified of interesting geo-textual objects during a period of time. For example, a user may want to be informed when tweets containing term "garage sale" are posted within 5 km of the user's home in the next 72 hours. In this paper, for the first time we study the problem of matching a stream of incoming Boolean Range Continuous queries over a stream of incoming geo-textual objects in real time. We develop a new system for addressing the problem. In particular, we propose a hybrid index, called IQ-tree, and novel cost models for managing a stream of incoming Boolean Range Continuous queries. We also propose algorithms for matching the queries with incoming geo-textual objects based on the index. Results of empirical studies with implementations of the proposed techniques demonstrate that the paper's proposals offer scalability and are capable of excellent performance.