Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach

A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given a join-index, we introduce a suite of methods based on clustering to compute the joins. We derive upper bounds on the length of the page-access sequences. Experimental results with Sequoia 2000 data sets show that the clustering method outperforms existing methods based on sorting and online-clustering heuristics.

• Type: Journal
• Year: 2002
• Where: TKDE
• Authors: Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Sivakumar Ravada
• Keywords: Data Sets, Limited Buffer Space, Page-access Sequences, TKDE 2002