Location-Aware Pub/Sub System
Authors:
Open Access
- 27 May 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 843-857
Abstract
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-commerce applications. Users are notified instantly when there is a matching event nearby. To the best of our knowledge, Elaps is the first to take into account continuous moving queries against dynamic event streams. Like existing works on continuous moving query processing,Elaps employs the concept of safe region to reduce communication overhead. However, unlike existing works which assume data from publishers are static, updates to safe regions may be triggered by newly arrived events. In Elaps, we develop a concept called \textit{impact region} that allows us to identify whether a safe region is affected by newly arrived events. Moreover, we propose a novel cost model to optimize the safe region size to keep the communication overhead low. Based on the cost model, we design two incremental methods, iGM and idGM, for safe region construction. In addition, Elaps uses boolean expression, which is more expressive than keywords, to model user intent and we propose a novel index, BEQ-Tree, to handle spatial boolean expression matching. In our experiments, we use geo-tweets from Twitter and venues from Foursquare to simulate publishers and boolean expressions generated from AOL search log to represent users intentions. We test user movement in both synthetic trajectories and real taxi trajectories. The results show that Elaps can significantly reduce the communication overhead and disseminate events to users in real-time.Keywords
Funding Information
- NExT Search Centre (R-252-300-001-490)
- The NSFC project (61422205 61472198)
- the Chinese Special Project of Science and Technology (2013zx01039-002-002)
- the 973 Program of China (2015CB358700)
This publication has 24 references indexed in Scilit:
- Efficient continuous top-k spatial keyword queries on road networksGeoInformatica, 2014
- High-Performance Location-Aware Publish-Subscribe on GPUs2012
- Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets2009
- Optimizing bitmap indices with efficient compressionACM Transactions on Database Systems, 2006
- iDistanceACM Transactions on Database Systems, 2005
- Filtering algorithms and implementation for very fast publish/subscribe systemsACM SIGMOD Record, 2001
- Query processing and optimization in Oracle RdbThe VLDB Journal, 1996
- Index structures for selective dissemination of information under the Boolean modelACM Transactions on Database Systems, 1994
- R-treesACM SIGMOD Record, 1984
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974