The role of parellelism in file organization

Authors:
Leslie L. Miller;Tyne Liang
Affiliations:
Iowa State University, Ames, Iowa;National Chiao Tung University, Hsinchu, Taiwan
Venue:
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Year:
1985

Citing 4
Cited 0

File Organization: On the Selection of Random Access Index Points for Sequential Files

Journal of the ACM (JACM)
A Survey of Parallel Machine Organization and Programming

ACM Computing Surveys (CSUR)
Interpolation search—a log logN search

Communications of the ACM
Dynamic information and library processing

Dynamic information and library processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The role parallelism can play in searching large collections of data is investigated. Three primary methods of making use of parallelism are discussed. The first is the traditional use of parallelism in searching, that is to speed up the search operation. The second was of parallelism discussed in the paper is to extend the facilities of a file organization, e.g. the ability of the operation to handle insertions. The last use of parallelism investigated is the use of the parallel processing resource to improve the quality of the search. Examples of each of the three methods are provided with simulation results illustrating the impact of parallelism.