Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 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
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Memory-adaptive scheduling for large query execution
Proceedings of the seventh international conference on Information and knowledge management
Memory allocation strategies for complex decision support queries
Proceedings of the seventh international conference on Information and knowledge management
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Caching Strategies for Spatial Joins
Geoinformatica
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
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
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Benchmarking Spatial Joins À La Carte
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Knowledge and Data Engineering
The Impact of Buffering on Closest Pairs Queries Using R-Trees
ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information Systems
The BASIS System: A Benchmarking Approach for Spatial Index Structures
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Research Issues in Spatio-temporal Database Systems
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
On Multi-way Spatial Joins with Direction Predicates
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
IEEE Transactions on Knowledge and Data Engineering
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
ACM Transactions on Database Systems (TODS)
Continuous Spatiotemporal Trajectory Joins
GeoSensor Networks
Predictive Join Processing between Regions and Moving Objects
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R*-tree indexed relations and use a common set of spatial joins algorithms, among which one is a novel extension of a strategy based on an on-the-fly index creation prior to the join with another indexed relation. A common platform is used on which a set of spatial access methods and join algorithms are available. The QEPs are implemented with a general iterator-based spatial query processor, allowing for pipelined QEP execution, thus minimizing memory space required for intermediate results.