Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
AGM: a dataflow database machine
Bic L., Hartmann R. ACM Transactions on Database Systems14 (1):114-146,1989.Type:Article
Date Reviewed: Jan 1 1990

The dataflow database machine is designed to be a highly parallel database machine with many processing elements and many small disks. Since I/O bandwidth is a necessary but not sufficient condition to guarantee better performance, the major theme of the paper is how to usefully capture this potential increase in bandwidth. The authors address this problem first in the form of a computational model, second in the model’s realization as an architecture, and last in such issues as concurrency control, recovery from hardware and software failures, and the interleaving of nonserializable transactions. The most interesting aspect of this approach is the active graph model, the AGM of the title, which is both the dataflow database machine’s conceptual organization and its method of executing transactions. It achieves its design goals of having no visible parallelism in queries, distributed control and storage, and the ability to process many requests concurrently. In the AGM’s conceptual organization, each node is an entity or relationship in the entity-relationship (ER) model, and related elements of an entity, or relationships, are connected by bidirectional arcs. Each node is an autonomous processing element, giving the AGM its dataflow aspect.

The AGM loses some of its elegance when mapped onto an architecture. Among the other hazards of reality, the system can never have enough processing elements for one per graph node, and the nodes can never be fully interconnected. The hardware implementation section comprehensively describes the major architectural characteristics of the dataflow database machine. The methods of achieving data integrity and failure recovery, which are especially hard to build in a dataflow machine and especially important to have in a database machine, have a workable design. Although performance is discussed for the individual disk storage components, the authors provide no discussion or prediction of complete system performance. Otherwise this paper is well written and presents an interesting, significant piece of work. I look forward to reading the authors’ forthcoming paper in which they promise to present performance results from their recently built prototype.

Reviewer:  F. S. Shipman Review #: CR113456
Bookmark and Share
 
Database Machines (H.2.6 )
 
 
Data-Flow Architectures (C.1.3 ... )
 
 
Modeling Techniques (C.4 ... )
 
 
Parallel Processors (C.1.2 ... )
 
 
Query Languages (H.2.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Database Machines": Date
VLSI implementation of a stochastic database machine for relational algebra and hashing
Elleithy K., Bayoumi M., Delcambre L. Integration, the VLSI Journal 11(2): 169-190, 1991. Type: Article
Oct 1 1992
Hardware support for advanced data management systems
Neches P. Computer 17(11): 29-40, 1984. Type: Article
Jul 1 1985
Analysis of database system architectures using benchmarks
Yao S., Hevner A., Young-Myers H. IEEE Transactions on Software Engineering SE-13(6): 709-725, 1987. Type: Article
Jun 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy