Benchmarking spatial joins a la carte
Authors:
Oliver Gunther;
Philippe Picouet;
Jean-Marc Saglio;
Michel Scholl; Vincent Oria
DOI:
10.1080/136588199241049
Publication Frequency:
12 issues per year
Published in:
International Journal of Geographical Information Science,
Volume
13,
Issue
7
January
1999
, pages 639
- 655
Subjects:
Cartography;
Computer Science (General);
Earth Sciences;
Geographic Information Systems;
Location Based Services;
Navigation;
Systems & Computer Architecture of Databases;
Topography;
Transport Geography;
Number of References: 23
Formats available:
PDF
(English)
Previously published as:
International journal of geographical information systems
(0269-3798,
1362-3087)
until 1996
View Article:
View Article (PDF)
Abstract
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 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 two real-life data sets from the Sequoia 2000 storage benchmark. Our results show that the relative performance of the different techniques mainly depends on the selectivity factor 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.
|
| view references (23) |

Download Citation


CiteULike
Del.icio.us
BibSonomy
Connotea