Scalable continuous query processing and moving object indexing in spatio-temporal databases

Authors:
Xiaopeng Xiong
Affiliations:
Department of Computer Science, Purdue University
Venue:
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Year:
2006

Citing 46
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bulk-insertions into R-trees using the small-tree-large-tree approach

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
A greedy algorithm for bulk loading R-trees

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
On indexing mobile objects

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Indexing moving points (extended abstract)

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees

Journal of Intelligent Information Systems
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects

IEEE Transactions on Computers
Dynamic Queries over Mobile Objects

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Modeling and Querying Moving Objects

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Dynamic Granular Locking Approach to Phantom Protection in R-Trees

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Performance of Nearest Neighbor Queries in R-Trees

ICDT '97 Proceedings of the 6th International Conference on Database Theory
A Generic Approach to Bulk Loading Multidimensional Index Structures

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects

IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
GBI: A Generalized R-Tree Bulk-Insertion Strategy

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Querying Mobile Objects in Spatio-Temporal Databases

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Storage and Retrieval of Moving Objects

MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Hashing Moving Objects

MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree

MDM '02 Proceedings of the Third International Conference on Mobile Data Management
SEB-tree: An Approach to Index Continuously Moving Objects

MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
PSoup: a system for streaming queries over streaming data

The VLDB Journal — The International Journal on Very Large Data Bases
Towards scalable location-aware services: requirements and research issues

GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Scalable Spatio-temporal Continuous Query Processing for Location-aware Services

SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
SINA: scalable incremental processing of continuous queries in spatio-temporal databases

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
STRIPES: an efficient index for predicted trajectories

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
The k-Nearest Neighbour Join: Turbo Charging the KDD Process

Knowledge and Information Systems
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
R-trees with Update Memos

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Streaming queries over streaming data

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Supporting frequent updates in R-trees: a bottom-up approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The TPR*-tree: an optimized spatio-temporal access method for predictive queries

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Improving performance with bulk-inserts in Oracle R-trees

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Gorder: an efficient method for KNN join processing

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Query and update efficient B+-tree based indexing of moving objects

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Maintenance of spatial semijoin queries on moving points

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spatio-temporal database systems aim to answer continuous spatio-temporal queries issued over moving objects. In many scenarios such as in a wide area, the number of outstanding queries and the number of moving objects are so large that a server fails to process queries promptly. In our work, we aim to develop scalable techniques for spatio-temporal database systems. We focus on two aspects of spatio-temporal database systems: 1) the query processing algorithms for a large set of concurrent queries, and 2) the underlying indexing structures for constantly moving objects. For continuous query processing, we explore the techniques of Incremental Evaluation and Shared Execution, especially to k-nearest-neighbor queries. For moving object indexing, we utilize Update Memos to support frequent updates efficiently in spatial indexes such as R-trees. In this paper, we first identify the challenges towards scalable spatio-temporal databases, then review the current contributions we have achieved so far and discuss future research directions.