Scalable spatio-temporal continuous query processing for location-aware services
Xiaopeng Xiong,Mohamed F. Mokbel,W.C. Aref,Susanne E. Hambrusch,Sunil Prabhakar +4 more
- 21 Jun 2004
- Vol. 16, pp 317-326
TL;DR: This paper uses shared execution as a mechanism to support scalability in location-aware servers to maintain a query table that stores information about continuous spatio-temporal queries and introduces the concept of a no-action region that is used in conjunction with the hot join policy.
read more
Abstract: Real-time spatio-temporal query processing needs to effectively handle a large number of moving objects and continuous spatio-temporal queries. In this paper, we use shared execution as a mechanism to support scalability in location-aware servers. Our main idea is to maintain a query table that stores information about continuous spatio-temporal queries. Then, answering spatio-temporal queries is abstracted as a spatial join among the moving objects and queries. Three query join policies 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On trip planning queries in spatial databases
Feifei Li,Dihan Cheng,Marios Hadjieleftheriou,George Kollios,Shang-Hua Teng +4 more
- 22 Aug 2005
TL;DR: This paper provides a number of approximation algorithms with approximation ratios that depend on either the number of categories, the maximum number of points per category or both, and gives an experimental evaluation of the proposed algorithms using both synthetic and real datasets.
Location-dependent query processing: Where we are and where we are heading
TL;DR: The technological context (mobile computing) and support middleware (such as moving object databases and data stream technology) are described, location-based services and location-dependent queries are defined and classified, and different query processing approaches are reviewed and compared.
197
•Journal Article
MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system
Bugra Gedik,Ling Liu +1 more
TL;DR: This paper introduces a set of optimization techniques, such as Lazy Query Propagation, Query Grouping, and Safe Periods, to constrict the amount of computations handled by the moving objects and to enhance the performance and system utilization of Mobieyes.
183
Continuous Query Processing of Spatio-Temporal Data Streams in PLACE
TL;DR: A continuous query processor designed specifically for highly dynamic environments (e.g., location-aware environments) and implemented inside the PLACE server (Pervasive Location-Aware Computing Environments), which shows promising performance.
133
Mobility Patterns
Cédric du Mouza,Philippe Rigaux +1 more
- 01 Dec 2005
TL;DR: A generic query language to retrieve objects that match mobility patterns describing a sequence of moves is defined to express only deterministic queries and evaluation techniques to maintain incrementally the result of queries are discussed.
120
References
R-trees: a dynamic index structure for spatial searching
Antonin Guttman
- 01 Jun 1984
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
8K
Continuously adaptive continuous queries over streams
Samuel Madden,Mehul A. Shah,Joseph M. Hellerstein,Vijayshankar Raman +3 more
- 03 Jun 2002
TL;DR: This work presents a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework that provides significant performance benefits over existing approaches to evaluating continuous queries, not only because of its adaptivity, but also because of the aggressive cross-query sharing of work and space that it enables.
Efficient processing of spatial joins using R-trees
Thomas Brinkhoff,Hans-Peter Kriegel,Bernhard Seeger +2 more
- 01 Jun 1993
TL;DR: This paper presents a first detailed study of spatial join processing using R-trees, particularly R*-tree, and presents several techniques for improving its execution time with respect to both, CPU- and I/O-time.
On indexing mobile objects
George Kollios,Dimitrios Gunopulos,Vassilis J. Tsotras +2 more
- 01 May 1999
TL;DR: A lower bound on the number of I/O’s needed to answer the d-dimensional problem is given and a practical approximation algorithm also in the dynamic, external memory setting, which has linear space and expected logarithmic query time is given.
Supporting frequent updates in R-trees: a bottom-up approach
Mong Li Lee,Wynne Hsu,Christian S. Jensen,Bin Cui,Keng Lik Teo +4 more
- 09 Sep 2003
TL;DR: In this article, a bottom-up update strategy for R-trees is proposed to improve the performance of R-tree updates by using a compact main-memory summary structure that allows direct access to the index nodes.