Performance modeling of data base management systems

Thesis/Dissertation · Wed Jan 01 04:00:00 EST 1986

OSTI ID:7204053

Lin, L S

Concurrency-control algorithms allow concurrent transactions for data base processing and also introduce the interference between transactions. This feature complicates the performance evaluation of concurrency-control algorithms. Two concurrency-control algorithms, the simplified locking algorithm and the optimistic timestamps algorithm, are studied here in detail, and a general modeling procedure is introduced. The simplified locking algorithm allows the least concurrency. In comparison with the optimistic timestamps algorithm, the simplified locking algorithm works well in heavy traffic. According to the relationships between database items, the transactions are classified into a number of classes. The average number of ACTIVE transactions in a class and the thruput of a class of transactions represent, respectively, the concurrency and the interference between transactions. The results of analyses of the algorithms also provide other quantities such as the communication cost per accepted transaction and the data item utilization. It is likely that the data base system of the future will one mainframe to manage the stored data, together with microcomputers to handle the human-to-machine interface in interactive transaction-based system.

• Research Organization: Illinois Univ., Chicago (USA)
• OSTI ID: 7204053
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COMPUTERS
DATA BASE MANAGEMENT
ELECTRONIC CIRCUITS
FORECASTING
MAN-MACHINE SYSTEMS
MANAGEMENT
MATHEMATICAL LOGIC
MICROELECTRONIC CIRCUITS
MICROPROCESSORS
PERFORMANCE
SYSTEMS ANALYSIS