ACM Home Page
Please provide us with feedback. Feedback
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
Full text PdfPdf (332 KB)
Source International Conference on Management of Data archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Paris, France
SESSION: Research sessions: moving objects table of contents
Pages: 623 - 634  
Year of Publication: 2004
ISBN:1-58113-859-8
Authors
Mohamed F. Mokbel  Purdue University, West Lafayette, IN
Xiaopeing Xiong  Purdue University, West Lafayette, IN
Walid G. Aref  Purdue University, West Lafayette, IN
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 118,   Citation Count: 50
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1007568.1007638
What is a DOI?

ABSTRACT

This paper intoduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluting a set of concurrent continuous spatio-temporal queries. SINA is designed with two goals in mind: (1) Scalability in terms of the number of concurrent continuous spatio-temporal queries, and (2) Incremental evaluation of continyous spatio-temporal queries. SINA achieves scalability by empolying a shared execution paradigm where the execution of continuous spatio-temporal queries is abstracted as a spatial join between a set of moving objects and a set of moving queries. Incremental evaluation is achived by computing only the updates of the previously reported answer. We introduce two types of updaes, namely positive and negative updates. Positive or negative updates indicate that a certain object should be added to or removed from the previously reported answer, respectively. SINA manages the computation of postive and negative updates via three phases: the hashing phase, the invalidation phase, and the joining phase. the hashing phase employs an in-memory hash-based join algorithm that results in a set a positive upldates. The invalidation phase is triggered every T seconds or when the memory is fully occupied to produce a set of negative updates. Finally, the joining phase is triggered by the end of the invalidation phase to produce a set of both positive and negative updates that result from joining in-memory data with in-disk data. Experimental results show that SINA is scalable and is more efficient than other index-based spatio-temporal algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
4
 
5
Ying Cai, Kien A. Hua, and Guohong Cao. Processing Range-Monitoring Queries on Heterogeneous Mobile Objects, in Mobile Data Management, MDM, 2004.
 
6
Sirish Chandrasekaran and Micheal J. Franklin. Streaming Queries over Streaming Data. In VLDB, 2002.
7
 
8
Bugra Gedik and Ling Liu. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System. In EDBT, 2004.
9
 
10
Marios Hadjieleftheriou, George Kollios, Dimitrios Gunopulos, and Vassilis J. Tsotras. On-Line Discovery of Dense Areas in Spatio-temporal Databases. In SSTD, 2003.
 
11
 
12
Moustafa A. Hammad, Micheal J. Franklin, Walid G. Aref, and Ahmed K. Elmagarmid. Scheduling for Shared Window Joins over Data Streams. In VLDB, 2003.
13
 
14
 
15
 
16
Mong-Li Lee, Wynne Hsu, Christian, S. Jensen, and Keng Lik Teo. Supporting Frequent Updates in R-Tree: A Bottom-Up Approach. In VLDB, 2003.
 
17
Mohamed F. Mokbel, Thanaa, M. Ghanem, and Walid G. Aref. Spatio-temporal Access Methods. IEEE Data Engineering Bulletin, 26(2), 2003.
 
18
19
 
20
21
22
23
 
24
 
25
 
26
Yufei Tao, Dimitris Papadias, and Qiongmao Shen. Continuous Nearest Neighbour Search. In VLDB, 2002.
 
27
Yufei Tao, Dimitris Papadias, and Jimeng Sun. The TPR*-Tree: An Optimized Spatio-temporal Access Method for Predictive Queries. In VLDB, 2003.
28
 
29
Tolga Urhan and Michael J. Franklin. XJoin: A Reactively-Scheduled Pipelined Join Operator. IEEE Data Engineering Bulletin, 23(2), 2000.
 
30
 
31
Ouri Wolfson and Huabei Yin. Accuracy and Resource Concumption in Tracking and Location Prediction. In SSTD, 2003.
32
 
33

CITED BY  50
Collaborative Colleagues:
Mohamed F. Mokbel: colleagues
Xiaopeing Xiong: colleagues
Walid G. Aref: colleagues