Novel parallel join algorithms for grid files

Salahadin Mohammed; Bala Srinivasan; M. Bozyigit; Phu Dung Le

Novel parallel join algorithms for grid files

Salahadin Mohammed^*, Bala Srinivasan, M. Bozyigit, Phu Dung Le

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

2 Scopus citations

Abstract

The present advances in parallel and distributed processing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data partitioning phase prior to the join operation. This paper presents new parallel join algorithms for relations based on grid files where no costly partitioning phase is involved, hence the performance can improve.

Original language	English
Pages	144-149
Number of pages	6
State	Published - 1996
Externally published	Yes

ASJC Scopus subject areas

Engineering (all)

Cite this

@conference{69228d114e3b404f83e093fdb479060d,

title = "Novel parallel join algorithms for grid files",

abstract = "The present advances in parallel and distributed processing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data partitioning phase prior to the join operation. This paper presents new parallel join algorithms for relations based on grid files where no costly partitioning phase is involved, hence the performance can improve.",

author = "Salahadin Mohammed and Bala Srinivasan and M. Bozyigit and Le, {Phu Dung}",

year = "1996",

language = "English",

pages = "144--149",

}

TY - CONF

T1 - Novel parallel join algorithms for grid files

AU - Mohammed, Salahadin

AU - Srinivasan, Bala

AU - Bozyigit, M.

AU - Le, Phu Dung

PY - 1996

Y1 - 1996

N2 - The present advances in parallel and distributed processing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data partitioning phase prior to the join operation. This paper presents new parallel join algorithms for relations based on grid files where no costly partitioning phase is involved, hence the performance can improve.

AB - The present advances in parallel and distributed processing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data partitioning phase prior to the join operation. This paper presents new parallel join algorithms for relations based on grid files where no costly partitioning phase is involved, hence the performance can improve.

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

M3 - Paper

AN - SCOPUS:0030379464

SP - 144

EP - 149

ER -

Novel parallel join algorithms for grid files

Abstract

ASJC Scopus subject areas

Fingerprint

Cite this