Efficient join-index-based spatial-join processing: A clustering approach

Shashi Shekhar, Chang Tien Lu, Sanjay Chawla, Sivakumar Ravada

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1400-1421
Number of pages22
JournalIEEE Transactions on Knowledge and Data Engineering
Volume14
Issue number6
DOIs
Publication statusPublished - Nov 2002
Externally publishedYes

Fingerprint

Query processing
Processing
Sorting
Data structures
Costs

Keywords

  • Join index
  • Join processing
  • Optimal page access sequence
  • Spatial join

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Efficient join-index-based spatial-join processing : A clustering approach. / Shekhar, Shashi; Lu, Chang Tien; Chawla, Sanjay; Ravada, Sivakumar.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 14, No. 6, 11.2002, p. 1400-1421.

Research output: Contribution to journalArticle

Shekhar, Shashi ; Lu, Chang Tien ; Chawla, Sanjay ; Ravada, Sivakumar. / Efficient join-index-based spatial-join processing : A clustering approach. In: IEEE Transactions on Knowledge and Data Engineering. 2002 ; Vol. 14, No. 6. pp. 1400-1421.
@article{44d3a49958684496a8732100ad8db7ec,
title = "Efficient join-index-based spatial-join processing: A clustering approach",
abstract = "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.",
keywords = "Join index, Join processing, Optimal page access sequence, Spatial join",
author = "Shashi Shekhar and Lu, {Chang Tien} and Sanjay Chawla and Sivakumar Ravada",
year = "2002",
month = "11",
doi = "10.1109/TKDE.2002.1047776",
language = "English",
volume = "14",
pages = "1400--1421",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Efficient join-index-based spatial-join processing

T2 - A clustering approach

AU - Shekhar, Shashi

AU - Lu, Chang Tien

AU - Chawla, Sanjay

AU - Ravada, Sivakumar

PY - 2002/11

Y1 - 2002/11

N2 - 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.

AB - 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.

KW - Join index

KW - Join processing

KW - Optimal page access sequence

KW - Spatial join

UR - http://www.scopus.com/inward/record.url?scp=0036857123&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036857123&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2002.1047776

DO - 10.1109/TKDE.2002.1047776

M3 - Article

AN - SCOPUS:0036857123

VL - 14

SP - 1400

EP - 1421

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 6

ER -