skip to main content
10.1145/1071246.1071270acmconferencesArticle/Chapter ViewAbstractPublication PagesmdmConference Proceedingsconference-collections
Article

GPAC: generic and progressive processing of mobile queries over mobile data

Published:09 May 2005Publication History

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.

References

  1. D. J. Abadi. et. al. Aurora: A New Model and Architecture for Data Stream Management. VLDB Journal, 12(2):120--139, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. Brinkhoff. A Framework for Generating Network-Based Moving Objects. GeoInformatica, 6(2), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle Scholar
  6. S. Chandrasekaran and M. J. Franklin. PSoup: a system for streaming queries over streaming data. VLDB Journal, 12(2):140--156, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Chen, D. J. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A Scalable Continuous Query System for Internet Databases. In SIGMOD, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarCross RefCross Ref
  9. 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 ScholarGoogle Scholar
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems. In VLDB, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. S. Iwerks, H. Samet, and K. Smith. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. In VLDB, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. C. S. Jensen, D. Lin, and B. C. Ooi. Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In VLDB, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. B. Lin and J. Su. On Bulk Loading TPR-Tree. In Mobile Data Management, MDM, 2004.Google ScholarGoogle Scholar
  18. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. F. Mokbel, X. Xiong, and W. G. Aref. SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In SIGMOD, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  21. 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 ScholarGoogle Scholar
  22. 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 ScholarGoogle Scholar
  23. T. Nadeem, S. Dashtinezhad, C. Liao, and L. Iftode. Traffic View: A Scalable Traffic Monitoring System. In Mobile Data Management, MDM, 2004.Google ScholarGoogle Scholar
  24. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group Nearest Neighbor Queries. In ICDE, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  26. J. M. Patel, Y. Chen, and V. P. Chakka. STRIPES: An Efficient Index for Predicted Trajectories. In SIGMOD, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  28. S. Saltenis and C. S. Jensen. Indexing of Moving Objects for Location-Based Services. In ICDE, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  29. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In SIGMOD, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  31. Z. Song and N. Roussopoulos. SEB-tree: An Approach to Index Continuously Moving Objects. In Mobile Data Management, MDM, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Y. Tao and D. Papadias. Time-parameterized queries in spatio-temporal databases. In SIGMOD, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. In VLDB, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Y. Tao, D. Papadias, and J. Sun. The TPR*-Tree: An Optimized Spatio-temporal Access Method for Predictive Queries. In VLDB, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  36. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  37. J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. L. Lee. Location-based Spatial Queries. In SIGMOD, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. GPAC: generic and progressive processing of mobile queries over mobile data

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            MDM '05: Proceedings of the 6th international conference on Mobile data management
            May 2005
            329 pages
            ISBN:1595930418
            DOI:10.1145/1071246

            Copyright © 2005 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 9 May 2005

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader