Back to Search Start Over

Slot index spatial join

Authors :
Mamoulis, Nikos
Papadias, Dimitris
Source :
IEEE Transactions on Knowledge and Data Engineering. Jan-Feb, 2003, Vol. 15 Issue 1, p211, 21 p.
Publication Year :
2003

Abstract

Efficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by an R-tree. We explore two optimization techniques that reduce the space requirements and the computational cost of SISJ and we compare it, analytically and experimentally, with other spatial join methods for two cases: 1) when the nonindexed input is read from disk and 2) when it is an intermediate result of a preceding database operator in a complex query plan. The importance of buffer splitting between consecutive join operators is also demonstrated through a two-join case study and a method that estimates the optimal splitting is proposed. Our evaluation shows that SISJ outperforms alternative methods in most cases and is suitable for limited memory conditions. Index Terms--Spatial databases, query processing, join processing, database index, spatial index, buffer management.

Details

ISSN :
10414347
Volume :
15
Issue :
1
Database :
Gale General OneFile
Journal :
IEEE Transactions on Knowledge and Data Engineering
Publication Type :
Academic Journal
Accession number :
edsgcl.96738702