Systolic arrays for rapid processing of simple data base transactions

Thesis/Dissertation · Sun Jan 01 04:00:00 EST 1984

OSTI ID:6275048

Lehman, P L

This dissertation is an exploration of a method of using the computational power available from Very Large Scale Integration (VLSI) to solve an important data base management problem. In many of the largest commercial data base systems, most types of transactions have two characteristics in common: simplicity (for example, cashing a check in a banking data base requires very few data base operations) and high frequency of execution (a bank may need to execute thousands of similar simple transactions per second.) A systolic array design is proposed for rapid execution of simple relational data base transactions. The simple query array is intended for use as a component of a high-performance relational data base machine. Transaction fragments from a batch of similar transactions are executed simultaneously by passing a data base relation through the array. This scheme produces a substantial reduction in the amount of input-output necessary to process the transactions. Several simple query arrays are arranged as stages of a pipeline to allow concurrent processing of several multi-relation transaction batches. Consistency problems may arise from concurrent transaction execution.

• Research Organization: Carnegie-Mellon Univ., Pittsburgh, PA (USA)
• OSTI ID: 6275048
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
990300 -- Information Handling
ACCURACY
ARRAY PROCESSORS
COMPUTERS
DATA BASE MANAGEMENT
DATA PROCESSING
DESIGN
DIGITAL COMPUTERS
MANAGEMENT
PROCESSING
SUPERCOMPUTERS