Data-driven data base model and its implementation on a highly-parallel architecture
The search for computer architectures utilizing large numbers of processing elements and their application to suitable problems has been a continual quest for many researchers. This dissertation presents results of an analysis of a multiprocessor architecture applied to the problem of data base management. The data base problem is first re-stated in terms of a new data model, the Active Graph Model, which employs a graphical representation for data (nodes) and relationships (arcs) in addition to concepts from the data flow model of computation to exploit the parallel processing power of the architecture. The nodes of the graph are active elements that respond to requests in the form of tokens traveling along the arcs. This data model and its query language are shown to be relationally complete and therefore equivalent in expressive power to the Relational Model. A mesh-connected array of processing elements forms the basis for the architecture. The nodes and arcs of the model are mapped onto the architecture and practical algorithms are defined for distributing requests, data manipulation, and for sorting and reporting of results. Results of the experiments demonstrate that large numbers of processors can be used effectively, given a sufficiently large problem.
- Research Organization:
- California Univ., Irvine (USA)
- OSTI ID:
- 6266185
- Resource Relation:
- Other Information: Thesis (Ph. D)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel computer architectures for relational databases
An architecture for a wafer-scale-implemented MIMD parallel computer
Related Subjects
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
DATA BASE MANAGEMENT
PARALLEL PROCESSING
ALGORITHMS
IMPLEMENTATION
MANAGEMENT
MATHEMATICAL LOGIC
PROGRAMMING
990220* - Computers
Computerized Models
& Computer Programs- (1987-1989)