### Abstract

Original language | English |
---|---|

Title of host publication | International Series on Advances in High Performance Computing |

Publisher | Computational Mechanics Publ, Ashurst, United Kingdom |

Pages | 135-143 |

Number of pages | 9 |

Publication status | Published - 1 Jan 1997 |

### Fingerprint

### Cite this

*International Series on Advances in High Performance Computing*(pp. 135-143). Computational Mechanics Publ, Ashurst, United Kingdom.

}

*International Series on Advances in High Performance Computing.*Computational Mechanics Publ, Ashurst, United Kingdom, pp. 135-143.

**Complexity analysis of distributed database algorithm.** / LOO, W. S., Alfred; BLOOR, Chris; GREY, David.

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Research › peer-review

TY - GEN

T1 - Complexity analysis of distributed database algorithm

AU - LOO, W. S., Alfred

AU - BLOOR, Chris

AU - GREY, David

PY - 1997/1/1

Y1 - 1997/1/1

N2 - This paper presents the complexity analysis and empirical results of a distributed selection algorithm. The algorithm uses the statistical properties of the data file. The objective of the algorithm is to minimize the number of communication messages required for the whole selection process. The algorithm is designed to select the y th smallest key from a very large file which is physically distributed over many sites (stations). The size of the file is so large that it is not feasible or efficient to transfer all data to a single node as no node has sufficient memory space for internal sorting. The selection work will be shared by all sites involved and the load balancing is also ensured by the algorithm. The complexity of the algorithm is O(log log N/P) for a network with P stations and a file with N records.

AB - This paper presents the complexity analysis and empirical results of a distributed selection algorithm. The algorithm uses the statistical properties of the data file. The objective of the algorithm is to minimize the number of communication messages required for the whole selection process. The algorithm is designed to select the y th smallest key from a very large file which is physically distributed over many sites (stations). The size of the file is so large that it is not feasible or efficient to transfer all data to a single node as no node has sufficient memory space for internal sorting. The selection work will be shared by all sites involved and the load balancing is also ensured by the algorithm. The complexity of the algorithm is O(log log N/P) for a network with P stations and a file with N records.

UR - https://www.witpress.com/elibrary/wit-transactions-on-information-and-communication-technologies/18/7868

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

M3 - Conference paper (refereed)

SP - 135

EP - 143

BT - International Series on Advances in High Performance Computing

PB - Computational Mechanics Publ, Ashurst, United Kingdom

ER -