A simulation model of the MICRONET computer system during join processing

Authors:
Joseph D. Brownsmith
Affiliations:
-
Venue:
ANSS '81 Proceedings of the 14th annual symposium on Simulation
Year:
1981

Citing 5
Cited 1

Optimization of query evaluation algorithms

ACM Transactions on Database Systems (TODS)
Optimizing the performance of a relational algebra database interface

Communications of the ACM
Computing joins of relations

SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
High Performance Hardware for Database Systems

Systems for Large Data Bases
The process view of simulation (Operating and programming systems series)

The process view of simulation (Operating and programming systems series)

Join processing in relational databases

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The MICRONET computer system was specifically designed for processing distributed relational databases. This paper describes a simulation study of the queueing and resource utilization of this system during processing of a relational join operation. Problems associated with representing a computer network in a simulation model are presented. In our model, one set of simulation facilities can represent any node of interest in the network. The processing at each node involves competition for resources by the data bus and the join algorithm. This was represented by processes which were synchronized by Wait Event and Post Event primitives. An algorithm for interrupting a non-shareable resource (e.g. the cpu) was also developed. Results for various system loadings and database sizes are presented.