ABSTRACT
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that can be tuned through a set of methods to behave as various continuous queries (e.g., continuous range queries and continuous k-nearest-neighbor queries). GPAC algorithms aim to provide three goals: (1) Online evaluation through an in-memory processing of the incoming mobile data. (2) Progressive evaluation through employing an incremental evaluation paradigm. (3) Fast query response through employing an anticipation paradigm. Query answer is anticipated and is cached in memory to allow for fast evaluation. GPAC algorithms are encapsulated in physical pipelined query operators. GPAC pipelined operators can be combined with traditional query operators in a query execution plan to support a wide variety of continuous queries. Experimental results based on a real implementation inside a prototype streaming database engine show the efficiency of GPAC operators in providing incremental and fast response for continuous queries.
- D. J. Abadi. et. al. Aurora: A New Model and Architecture for Data Stream Management. VLDB Journal, 12(2):120--139, 2003. Google ScholarDigital Library
- W. G. Aref and I. F. Ilyas. SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees. Journal of Intelligent Info. Systems, JIIS, 17(2--3):215--240, 2001. Google ScholarDigital Library
- R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In Proceedings of the International Database Engineering and Application Symposium, IDEAS, 2002. Google ScholarDigital Library
- T. Brinkhoff. A Framework for Generating Network-Based Moving Objects. GeoInformatica, 6(2), 2002. Google ScholarDigital Library
- S. Chandrasekaran. et. al. TelegraphCQ: Continuous Dataflow Processing for an Uncertain World. In Proceedings of the International Conference of Innovative Innovative Data Systems Research, CIDR, 2003.Google Scholar
- S. Chandrasekaran and M. J. Franklin. PSoup: a system for streaming queries over streaming data. VLDB Journal, 12(2):140--156, 2003. Google ScholarDigital Library
- J. Chen, D. J. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A Scalable Continuous Query System for Internet Databases. In SIGMOD, 2000. Google ScholarDigital Library
- B. Gedik and L. Liu. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System. In Proceedings of the International Conference on Extending Database Technology, EDBT, 2004.Google ScholarCross Ref
- M. A. Hammad, T. M. Ghanem, W. G. Aref, A. K. Elmagarmid, and M. F. Mokbel. Efficient execution of sliding-window queries over data streams. Technical Report CSD-03-035, Department of Computer Science, Purdue University, 2004.Google Scholar
- M. A. Hammad, M. F. Mokbel, M. H. Ali, W. G. Aref, A. C. Catlin, A. K. Elmagarmid, M. Eltabakh, M. G. Elfeky, T. M. Ghanem, R. Gwadera, I. F. Ilyas, M. Marzouk, and X. Xiong. Nile: A Query Processing Engine for Data Streams (Demo). In ICDE, 2004. Google ScholarDigital Library
- J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems. In VLDB, 1995. Google ScholarDigital Library
- G. S. Iwerks, H. Samet, and K. Smith. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. In VLDB, 2003. Google ScholarDigital Library
- C. S. Jensen, D. Lin, and B. C. Ooi. Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In VLDB, 2004. Google ScholarDigital Library
- D. Kwon, S. Lee, and S. Lee. Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree. In Mobile Data Management, MDM, 2002. Google ScholarDigital Library
- I. Lazaridis, K. Porkaew, and S. Mehrotra. Dynamic Queries over Mobile Objects. In Proceedings of the International Conference on Extending Database Technology, EDBT, 2002. Google ScholarDigital Library
- M.-L. Lee, W. Hsu, C. S. Jensen, and K. L. Teo. Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In VLDB, 2003. Google ScholarDigital Library
- B. Lin and J. Su. On Bulk Loading TPR-Tree. In Mobile Data Management, MDM, 2004.Google Scholar
- M. F. Mokbel, W. G. Aref, S. E. Hambrusch, and S. Prabhakar. Towards Scalable Location-aware Services: Requirements and Research Issues. In Proceedings of the ACM Symposium on Advances in Geographic Information Systems, ACM GIS, 2003. Google ScholarDigital Library
- M. F. Mokbel, X. Xiong, and W. G. Aref. SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In SIGMOD, 2004. Google ScholarDigital Library
- M. F. Mokbel, X. Xiong, W. G. Aref, S. Hambrusch, S. Prabhakar, and M. Hammad. PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams (Demo). In VLDB, 2004. Google ScholarDigital Library
- M. F. Mokbel, X. Xiong, M. A. Hammad, and W. G. Aref. Continuous Query Processing of Spatio-temporal Data Streams in PLACE. In STDBM, 2004.Google Scholar
- R. Motwani. et. al. Query Processing, Approximation, and Resource Management in a Data Stream Management System. In Proceedings of the International Conference of Innovative Innovative Data Systems Research, CIDR, 2003.Google Scholar
- T. Nadeem, S. Dashtinezhad, C. Liao, and L. Iftode. Traffic View: A Scalable Traffic Monitoring System. In Mobile Data Management, MDM, 2004.Google Scholar
- D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group Nearest Neighbor Queries. In ICDE, 2004. Google ScholarDigital Library
- H. K. Park, J. H. Son, and M.-H. Kim. An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments. In Mobile Data Management, MDM, 2003. Google ScholarDigital Library
- J. M. Patel, Y. Chen, and V. P. Chakka. STRIPES: An Efficient Index for Predicted Trajectories. In SIGMOD, 2004. Google ScholarDigital Library
- S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch. Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Transactions on Computers, 51(10), 2002. Google ScholarDigital Library
- S. Saltenis and C. S. Jensen. Indexing of Moving Objects for Location-Based Services. In ICDE, 2002.Google ScholarCross Ref
- S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In SIGMOD, 2000. Google ScholarDigital Library
- Z. Song and N. Roussopoulos. K-Nearest Neighbor Search for Moving Query Point. In Proceedings of the International Symposium on Advances in Spatial and Temporal Databases, SSTD, 2001. Google ScholarDigital Library
- Z. Song and N. Roussopoulos. SEB-tree: An Approach to Index Continuously Moving Objects. In Mobile Data Management, MDM, 2003. Google ScholarDigital Library
- Y. Tao and D. Papadias. Time-parameterized queries in spatio-temporal databases. In SIGMOD, 2002. Google ScholarDigital Library
- Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. In VLDB, 2002. Google ScholarDigital Library
- Y. Tao, D. Papadias, and J. Sun. The TPR*-Tree: An Optimized Spatio-temporal Access Method for Predictive Queries. In VLDB, 2003. Google ScholarDigital Library
- X. Xiong, M. F. Mokbel, and W. G. Aref. SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In ICDE, 2005. To Appear. Google ScholarDigital Library
- X. Xiong, M. F. Mokbel, W. G. Aref, S. Hambrusch, and S. Prabhakar. Scalable Spatio-temporal Continuous Query Processing for Location-aware Services. In Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM, 2004. Google ScholarDigital Library
- J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. L. Lee. Location-based Spatial Queries. In SIGMOD, 2003. Google ScholarDigital Library
- B. Zheng and D. L. Lee. Semantic Caching in Location-Dependent Query Processing. In Proceedings of the International Symposium on Advances in Spatial and Temporal Databases. SSTD, 2001. Google ScholarDigital Library
Index Terms
- GPAC: generic and progressive processing of mobile queries over mobile data
Recommendations
OCEANUS: a spatio-temporal data stream system prototype
IWGS '12: Proceedings of the 3rd ACM SIGSPATIAL International Workshop on GeoStreamingRecent advances in wireless communication, miniaturization of spatially enabled devices and global navigation satellite systems (GNSS) services have resulted in a large number of novel application domains. Applications in these novel domains (moving ...
On Efficient and Scalable Support of Continuous Queries in Mobile Peer-to-Peer Environments
In this paper, we propose an efficient and scalable query processing framework for continuous spatial queries (range and k-nearest-neighbor queries) in mobile peer-to-peer (P2P) environments, where no fixed communication infrastructure or centralized/...
Multilevel secure data stream processing: Architecture and implementation
DBSec 2011The proliferation of sensors and mobile devices and their connectedness to the network have given rise to numerous types of situation monitoring applications. Data Stream Management Systems DSMSs have been proposed to address the data processing needs ...
Comments