Multidimensional access methods
ACM Computing Surveys (CSUR)
Oporto: A Realistic Scenario Generator for Moving Objects
Geoinformatica
A Framework for Generating Network-Based Moving Objects
Geoinformatica
On the Generation of 2-Dimensional Index Workloads
ICDT '99 Proceedings of the 7th International Conference on Database Theory
VESPA: A Benchmark for Vector Spatial Databases
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
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
A Performance Evaluation of Spatial Join Processing Strategies
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Indexing of now-relative spatio-bitemporal data
The VLDB Journal — The International Journal on Very Large Data Bases
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
ACM Transactions on Database Systems (TODS)
Index structures for data warehouses
Index structures for data warehouses
Benchmarking spatial data warehouses
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
An experimental analysis of iterated spatial joins in main memory
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Spatial joins are join operations that involve spatial data types and operators. Spatial access methods are often used to speed up the computation of spatial joins. This paper addresses the issue of {It benchmarking} spatial join operations. For this purpose, we first present a WWW-based benchmark generator to produce sets of rectangles. Using a Web browser, experimenters can specify the number of rectangles in a sample, as well as the statistical distributions of their sizes, shapes, and locations. Second, using the generator and a well-defined set of statistical models we define several tests to compare the performance of three spatial join algorithms: nested loop, scan-and-index, and synchronized tree traversal. We also added a real-life data set from the Sequoia 2000 storage benchmark. Our results show that the relative performance of the different techniques mainly depends on two parameters: sample size, and selectivity of the join predicate. All of the statistical models and algorithms are available on the Web, which allows for easy verification and modification of our experiments.