Sensitivity analysis of database operations : a case study of parallel partition/sorting algorithm

Wai Sing, Alfred LOO

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

1 Scopus Citations

Abstract

Many data sets follow certain distribution patterns, such as uniform distribution, normal distribution, and so on. Some algorithms for database operations make use of this distribution knowledge, and they usually perform much better than other algorithms, particularly in parallel computers. However, the distribution characteristics of certain data sets can change from time to time in real-life situations and affect the performance of these algorithms. It is thus important to know the behaviour of these algorithms under imperfect situations. This article presents the sensitivity analysis of a statistical algorithm for database operations when data sets do not follow the assumed distribution pattern. A parallel sorting algorithm designed by the author is used as a case study. This algorithm is for parallel computers with multiple instruction streams, multiple data streams architecture with shared memory.
Original languageEnglish
Pages (from-to)199-206
Number of pages8
JournalInternational Journal of Computers and Applications
Volume26
Issue number4
DOIs
Publication statusPublished - 1 Jan 2004

Fingerprint

Sorting
Sensitivity analysis
Normal distribution
Data storage equipment

Keywords

  • Database operations
  • Load balance
  • Parallel sorting algorithms
  • Sensitivity analysis

Cite this

@article{775bf046b35e4e728389a6580b003c0b,
title = "Sensitivity analysis of database operations : a case study of parallel partition/sorting algorithm",
abstract = "Many data sets follow certain distribution patterns, such as uniform distribution, normal distribution, and so on. Some algorithms for database operations make use of this distribution knowledge, and they usually perform much better than other algorithms, particularly in parallel computers. However, the distribution characteristics of certain data sets can change from time to time in real-life situations and affect the performance of these algorithms. It is thus important to know the behaviour of these algorithms under imperfect situations. This article presents the sensitivity analysis of a statistical algorithm for database operations when data sets do not follow the assumed distribution pattern. A parallel sorting algorithm designed by the author is used as a case study. This algorithm is for parallel computers with multiple instruction streams, multiple data streams architecture with shared memory.",
keywords = "Database operations, Load balance, Parallel sorting algorithms, Sensitivity analysis",
author = "LOO, {Wai Sing, Alfred}",
year = "2004",
month = "1",
day = "1",
doi = "10.1080/1206212X.2004.11441743",
language = "English",
volume = "26",
pages = "199--206",
journal = "International Journal of Computers and Applications",
issn = "1206-212X",
publisher = "Taylor and Francis Ltd.",
number = "4",

}

Sensitivity analysis of database operations : a case study of parallel partition/sorting algorithm. / LOO, Wai Sing, Alfred.

In: International Journal of Computers and Applications, Vol. 26, No. 4, 01.01.2004, p. 199-206.

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

TY - JOUR

T1 - Sensitivity analysis of database operations : a case study of parallel partition/sorting algorithm

AU - LOO, Wai Sing, Alfred

PY - 2004/1/1

Y1 - 2004/1/1

N2 - Many data sets follow certain distribution patterns, such as uniform distribution, normal distribution, and so on. Some algorithms for database operations make use of this distribution knowledge, and they usually perform much better than other algorithms, particularly in parallel computers. However, the distribution characteristics of certain data sets can change from time to time in real-life situations and affect the performance of these algorithms. It is thus important to know the behaviour of these algorithms under imperfect situations. This article presents the sensitivity analysis of a statistical algorithm for database operations when data sets do not follow the assumed distribution pattern. A parallel sorting algorithm designed by the author is used as a case study. This algorithm is for parallel computers with multiple instruction streams, multiple data streams architecture with shared memory.

AB - Many data sets follow certain distribution patterns, such as uniform distribution, normal distribution, and so on. Some algorithms for database operations make use of this distribution knowledge, and they usually perform much better than other algorithms, particularly in parallel computers. However, the distribution characteristics of certain data sets can change from time to time in real-life situations and affect the performance of these algorithms. It is thus important to know the behaviour of these algorithms under imperfect situations. This article presents the sensitivity analysis of a statistical algorithm for database operations when data sets do not follow the assumed distribution pattern. A parallel sorting algorithm designed by the author is used as a case study. This algorithm is for parallel computers with multiple instruction streams, multiple data streams architecture with shared memory.

KW - Database operations

KW - Load balance

KW - Parallel sorting algorithms

KW - Sensitivity analysis

UR - http://commons.ln.edu.hk/sw_master/2220

U2 - 10.1080/1206212X.2004.11441743

DO - 10.1080/1206212X.2004.11441743

M3 - Journal Article (refereed)

VL - 26

SP - 199

EP - 206

JO - International Journal of Computers and Applications

JF - International Journal of Computers and Applications

SN - 1206-212X

IS - 4

ER -