A comparison of spatial query processing techniques for native and parameter spaces
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
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 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
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The Quad View Data Structure - A Representation for Planar Subdivisions
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
A General and Efficient Implementation of Geometric Operators and Predicates
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Improving Spatial Intersect Joins Using Symbolic Intersect Detection
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Evaluation of Buffer Queries in Spatial Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Overlaying multiple maps efficiently
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
| Hi-index | 0.00 |
We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data.