Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
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
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Algorithms for Joining R-Trees and Linear Region Quadtrees
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
A Performance Evaluation of Spatial Join Processing Strategies
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
ACM Transactions on Database Systems (TODS)
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
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
Continuous Intersection Joins Over Moving Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Time-Aware Similarity Search: A Metric-Temporal Representation for Complex Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Panda: a predictive spatio-temporal query processor
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Hi-index | 0.00 |
The family of R-trees is suitable for indexing various kinds of multidimensional objects. TPR*-trees are R-tree based structures that have been proposed for indexing a moving object database, e.g. a data-base of moving boats. Region Quadtrees are suitable for indexing 2-dimensional regional data and their linear variant (Linear Region Quadtrees) is used in many Geographical Information Systems (GIS) for this purpose, e.g. for the representation of stormy, or sunny regions. Although, both are tree structures, the organization of data space, the types of spatial data stored and the search algorithms applied on them are different in R-trees and Region Quadtrees. In this paper, we examine a spatio-temporal problem that appears in many practical applications: processing of predictive joins between moving objects and regions (e.g. discovering the boats that will enter a storm), using these two families of data structures as storage and indexing mechanisms, and taking into account their similarities and differences. With a thorough experimental study, we show that the use of a synchronous Depth-First traversal order has the best performance balance (on average), taking into account the I/O activity and response time as performance measurements.