Benchmarking spatial joins A La Carte

被引：11

作者：

Gunther, O ^{[1
]}

Oria, V ^{[1
]}

Picouet, P ^{[1
]}

Saglio, JM ^{[1
]}

Scholl, M ^{[1
]}

机构：

[1] Humboldt Univ, Inst Wirtschaftsinformat, D-10178 Berlin, Germany

来源：

TENTH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT - PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/SSDM.1998.688109

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 a real-life darn 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.

引用

页码：32 / 41

页数：10