Mohammed, Salahadin Adem (1991) Join algorithms for parallel computers for relations based on interpolation based grid file. Masters thesis, King Fahd University of Petroleum and Minerals.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF 4Mb |
Arabic Abstract
-
English Abstract
The recent advances in parallel and distributed processing and its applications to database operations such as join have initiated extensive research in this field. Investigations on hash based join algorithms compared to methods such as join-index join and merge-sort have given encouraging results. However, they involve a costly data partitioning phase prior to the join. This costly partitioning phase can be avoided if file structures that keep data already partitioned in the secondary storage are used. Interpolation Based Grid File (IBGF) is such a file structure. In this thesis new joint algorithms for parallel computers for relations based on IBGF are investigated. Different algorithms are used for uniform relations and nonuniform relations. The efficiencies of these algorithms based on relation and architecture, have been studied using simulation. However the comparison of different techniques is not within the scope of this work.
| Item Type: | Thesis (Masters) |
|---|---|
| Date: | January 1991 |
| Date Type: | Completion |
| Subjects: | Computer |
| Divisions: | College Of Computer Sciences and Engineering > Information and Computer Science Dept |
| Creators: | Mohammed, Salahadin Adem |
| Committee Advisor: | Bozygit, M. |
| Committee Members: | Al-Tayyeb, M. A. and Ghanta, Subbarao |
| ID Code: | 10188 |
| Deposited By: | KFUPM ePrints Admin |
| Deposited On: | 22 Jun 2008 16:58 |
| Last Modified: | 26 Apr 2011 08:00 |
Repository Staff Only: item control page