A Distributed Framework for Spatio-Temporal Data Streams Processing through Continuous Query Process
Keywords:
PLACE (Pervasive Location-Aware Computing Environments) server, adaptable location-aware database server, RFID.Abstract
The enormous increment of cellular phones, GPS-like devices, and RFIDs brings about exceptionally unique situations where questions and also inquiries are constantly moving. In this paper, we show a persistent question processor planned particularly for exceedingly powerful situations (e.g., location-aware conditions). We executed the proposed nonstop inquiry processor inside the PLACE server (Pervasive Location-Aware Computing Environments); an adaptable location-awaredatabase server as of now created at Purdue University. The PLACE server stretches out information gushing administration frameworks to help location-awaresituations. Such conditions are described by the wide assortment of persistent spatio-temporal questions and the unbounded spatio-worldly streams. The proposed constant inquiry processor for the most part incorporates:
- Developing new incremental Spatio-temporal administrators to help a wide assortment of consistent spatio-worldly inquiries.
- Extending the semantic of sliding window questions to manage spatial sliding windows and temporal sliding windows.
- Providing a shared execution structure for adaptable execution of an arrangement of simultaneous consistent spatio-temporal questions. Preparatory test assessment demonstrates the promising execution of the consistent question processor of the PLACE server.
References
- S. Saltenis and C. S. Jensen.Indexing of Moving Objectsfor Location-Based Services In ICDE, 2002.
- S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A.Lopez.Indexing the Positions of Continuously MovingObjects.In SIGMOD, 2000.
- P. Seshadri. Predator: A Resource for Database Research.SIGMOD Record, 27(1):16{20, 1998.
- Z. Song and N. Roussopoulos.K-Nearest NeighborSearch for Moving Query Point.In SSTD, 2001.
- J. Sun, D. Papadias, Y. Tao, and B. Liu. Queryingabout the Past, the Present and the Future in Spatio-Temporal Databases.In ICDE, 2004.
- J. Chen, D. J. DeWitt, F. Tian, and Y. Wang.NiagaraCQ:A Scalable Continuous Query System forInternet Databases. In SIGMOD, 2000.
- B. Gedik and L. Liu.MobiEyes: Distributed Processingof Continuously Moving Queries on MovingObjects in a Cellular System. In EDBT, 2004.
- A. Guttman. R-Trees: A Dynamic Index Structurefor Spatial Searching. In SIGMOD, 1984.
- M. Hadjieleftheriou, G. Kollios, D. Gunopulos, andV. J. Tsotras. On-Line Discovery of Dense Areas inSpatio-temporal Databases. In SSTD, 2003.
- S. E. Hambrusch, C.-M.Liu, W. G. Aref, and S. Prabhakar.Query Processing in Broadcasted Spatial IndexTrees.In SSTD, 2001.
- M. A. Hammad, W. G. Aref, M. J. Franklin, M. F.Mokbel, and A. K. Elmagarmid.E_cient execution of sliding-window queries over data streams. Technical Report TR CSD-03-035, Purdue University Department of Computer Sciences, Dec. 2003.
- M. A. Hammad, M. J. Franklin, W. G. Aref, and A. K.Elmagarmid. Scheduling for shared window joins overdata streams. In VLDB, 2003.
- SHAIKASHA,P.S.NAVEENKUMAR Taxo-Finder to Build a Graph, Cgraph and Representing Domain Corpus and Their Associative Strengths Pages 1810-1814,2017 Publisher simhapuri publications.
- W. G. Aref, S. E. Hambrusch, and S. Prabhakar. Pervasive Location Aware Computing Environments(PLACE). http://www.cs.purdue.edu/place, 2003.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT

This work is licensed under a Creative Commons Attribution 4.0 International License.