Computational geometry: an introduction
Computational geometry: an introduction
Space-economical plane-sweep algorithms
Computer Vision, Graphics, and Image Processing
Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A practical divide-and-conquer algorithm for the rectangle intersection problem
Information Sciences: an International Journal
The input/output complexity of sorting and related problems
Communications of the ACM
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
Rule-based optimization and query processing in an extensible geometric database system
ACM Transactions on Database Systems (TODS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Multi-step processing of spatial joins
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
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 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
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
Efficient Computation of Spatial Joins
Proceedings of the Ninth 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 BASIS System: A Benchmarking Approach for Spatial Index Structures
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Benchmarking Spatial Joins À La Carte
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
A Performance Evaluation of Spatial Join Processing Strategies
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
External-Memory Algorithms with Applications in GIS
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes
IEEE Transactions on Knowledge and Data Engineering
Query optimizer for spatial join operations
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
ACM Transactions on Database Systems (TODS)
Fast point-feature label placement for dynamic visualizations
Information Visualization
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
| Hi-index | 0.00 |
We propose a new algorithm to solve the problem of joining two spatial relations R and S when S is indexed by an R-tree. The method combines classical query processing techniques and a plane-sweeping algorithm. We compare our approach to the simple indexed-nested-loop method and to the state-of-the-art algorithms, and show through analysis and experiments on synthetic and real-life datasets that our method outperforms in most cases the other ones, in both CPU and I/O. More importantly, it appears to be more robust regarding the many parameters involved in spatial query processing.