The Community for Technology Leaders
Scientific and Statistical Database Management, International Conference on (1998)
Capri, Italy
Apr. 1, 1998 to Apr. 3, 1998
ISBN: 0-8186-8575-1
pp: 32
Oliver Günther , Humboldt-Universit?t zu Berlin
Vincent Oria , University of Alberta
Philippe Picouet , ?cole Nationale Sup?rieure des T?l?communications
Jean-Marc Saglio , ?cole Nationale Sup?rieure des T?l?communications
Michel Scholl , CNAM and INRIA,
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 {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.
INDEX TERMS
Benchmark, spatial databases, spatial joins
CITATION

M. Scholl, P. Picouet, J. Saglio, O. Günther and V. Oria, "Benchmarking Spatial Joins ? La Carte," Scientific and Statistical Database Management, International Conference on(SSDBM), Capri, Italy, 1998, pp. 32.
doi:10.1109/SSDM.1998.688109
104 ms
(Ver 3.3 (11022016))