Response Time Analysis of Multiprocessor Computers for Database Support

Abstract

Comparison of three multiprocessor computer architectures for database support is made possible through evaluation of response time expressions. These expressions are derived by parameterizing algorithms performed by each machine to execute a relational algebra query. Parameters represent properties of the database and components of the machines. Studies of particular parameter values exhibit response times for conventional machine technology, for low selectivity, high duplicate occurrence, and parallel disk access, increasing the number of processors, and improving communication and processing technology.

SEPPHORIS: An augmented hypergraph‐grammar representation for events, stipulations, and legal prescriptions

“…They are not groups as meant in algebra.) Yet another sense: Goodman & Sequin (1981) and Shultz & Zingg (1984) are concerned with HYPERTREE, a certain kind of multiprocessor interconnection topology for a database machine (and also a certain system that typifies that topology). The HYPERTREE architecture is a configuration of X-TREE nodes (as developed in X-TREE, a previous project).…”