Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computational geometry: an introduction
Computational geometry: an introduction
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Dynamic inverted quadtree: a structure for pictorial databases
Information Systems - Special issue: multimedia information systems
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
Similarity query processing using disk arrays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Parallel Processing of Spatial Joins Using R-trees
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Generating Seeded Trees from Data Sets
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
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
ACM Transactions on Database Systems (TODS)
Predictive Join Processing between Regions and Moving Objects
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Non-interleaved quadtree node codification
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
| Hi-index | 0.00 |
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are suitable for storing 2-dimensional regional data and their linear variant is used in many Geographical Information Systems for this purpose. In this report, we present five algorithms suitable for processing join queries between these two successful, although very different, access methods. Two of the algorithms are based on heuristics that aim at minimizing I/O cost with a limited amount of main memory. We also present the results of experiments performed with real data that compare the I/O performance of these algorithms.