Download:
by Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar
In SSDBM
http://www.cs.purdue.edu/homes/aref/papers/SSDBM04.pdf
Add To MetaCart
Abstract:
The emergence of location-aware services calls for new real-time spatio-temporal query processing algorithms that deal with large numbers of moving objects and large numbers of continuous spatio-temporal queries. In this paper, we use shared execution as a mechanism to support scalability in location-aware servers. The main idea is to maintain a query table that stores information about continuous spatiotemporal queries. Then, answering spatio-temporal queries is abstracted as a spatial join among the moving objects and queries. Three query join polices are proposed aiming to minimize the cost of the join operation under the shared execution paradigm, namely the Clock-triggered Join Policy, the Incremental Join Policy, and the Hot Join Policy. We introduce the concept of a No-Action Region that is used in conjunction with the hot join policy. We propose algorithms that calculate the No-Action region for objects and queries. Experimental performance demonstrates that the No-Action region is more efficient than other approaches when used along with the hot join policy. Experiments also demonstrate that the hot join policy outperforms the clock-triggered join policy and the incremental join policy in terms of both I/O and CPU costs. 1
Citations
|
1668
|
R-Trees: A Dynamic Index Structure for Spatial Searching
– Guttman
- 1984
|
|
340
|
Niagaracq: A scalable continuous query system for internet databases
– Chen, DeWitt, et al.
- 2000
|
|
274
|
Efficient processing of spatial joins using r-trees
– Brinkhoff, Kriegel, et al.
- 1993
|
|
167
|
On indexing mobile objects
– Kollios, Gunopulos, et al.
- 1999
|
|
155
|
Continuously adaptive continuous queries over streams
– Madden, Shah, et al.
- 2002
|
|
151
|
Partition based spatial-merge join
– Patel, DeWitt
- 1996
|
|
85
|
Streaming queries over streaming data
– Chandrasekaran, Franklin
- 2002
|
|
71
|
K-nearest neighbor search for moving query point
– Song, Roussopoulos
- 2001
|
|
64
|
Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects
– Prabhakar, Xia, et al.
|
|
56
|
Scalable sweeping-based spatial join
– Arge, Procopiuc, et al.
- 1998
|
|
52
|
Continuous nearest neighbor search
– Tao, Papadias, et al.
- 2002
|
|
41
|
MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system
– Gedik, Liu
- 2004
|
|
38
|
Scheduling for Shared Window Joins over Data Streams
– Hammad, Franklin, et al.
- 2003
|
|
36
|
Supporting frequent updates in R-Trees: A bottom-up approach
– Lee, Hsu, et al.
- 2003
|
|
35
|
Design and evaluation of alternative selection placement strategies in optimizing continuous queries
– Chen, DeWitt, et al.
- 2002
|
|
35
|
Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree
– Kwon, Lee, et al.
- 2002
|
|
30
|
Dynamic queries over mobile objects
– Lazaridis, Porkaew, et al.
- 2002
|
|
28
|
Location-based spatial queries
– Zhang, Zhu, et al.
- 2003
|
|
18
|
Processing range-monitoring queries on heterogeneous mobile objects
– Cai, Hua, et al.
- 2004
|
|
5
|
Pervasive Location Aware Computing Environments (PLACE). http://www.cs.purdue.edu/place
– Aref, Hambrusch, et al.
- 2003
|