efficient processing of spatial joins using r-trees（有效地处理空间连接使用r - tree）.pdfVIP

Parallel Processing of Spatial Joins Using R-trees Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger Institute for Computer Science, University of Munich, Leopoldstr. 11 B, D-80802 München, Germany e-mail: {brink, kriegel, bseeger}@informatik.uni-muenchen.de Abstract: In this paper, we show that spatial joins are very suitable to be processed on a parallel hardware platform. The parallel system is equipped with a so-called shared virtual memory which is well-suited for the design and implementation of parallel spatial join algorithms. We start with an algorithm that consists of three phases: task creation, task assignment and parallel task execu- tion. In order to reduce CPU- and I/O-cost, the three phases are processed in a fashion that pre- serves spatial locality. Dynamic load balancing is achieved by splitting tasks into smaller ones and reassigning some of the smaller tasks to idle processors. In an experimental performance compar- ison, we identify the advantages and disadvantages of several variants of our algorithm. The most efficient one shows an almost optimal speed-up under the assumption that the number of disks is sufficiently large. Topics: spatial database systems, parallel database systems 1 Introduction During the last decade, research institutions and industrial institutions have shown great interest in the development of spatial database systems (SDBS). SDBS must cope with vast amounts of spatial objects such as points, lines, polygons, etc. One of the most important design goals is therefore to equip a SDBS with efficient implementations of the basic spatial operators. Among these operators, the window query and the spatial join are considered to be the most important ones. The window query is restricted to a scan through a single spatial relation, whereas the spa- tial join combines two (or more) spatial relati