Some experiments in directory organization - a simulation study

Authors:
Allen Reiter
Affiliations:
-
Venue:
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Year:
1976

Citing 5
Cited 1

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Identifier Search Mechanisms: A Survey and Generalized Model

ACM Computing Surveys (CSUR)
Analysis and performance of inverted data base structures

Communications of the ACM
A comparative analysis of disk scheduling policies

Communications of the ACM
Analysis of indexed sequential and direct access file organizations

SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control

B+ trees and indexed sequential files: a performance comparison

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a simulation model, experiments were conducted on various directory organization schemes and their performance implications. In particular we tested the effects of a multiprogrammed environment on system throughput for retrieval operations. Analysis of the results shows that different factors are relevant to performance for the various systems, and that under some circumstances ISAM and hash-coding may lose the advantages they possess over B-trees in a stand-alone environment when multiprogramming is used. Some results of sharing data among simultaneous users are also presented.