Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
Communications of the ACM - Special issue on computer architecture
A relational model of data for large shared data banks
Communications of the ACM
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Communication In X-TREE, A Modular Multiprocessor System
ACM '78 Proceedings of the 1978 annual conference
An investigation of multiprocessor structures and algorithms for data base management
An investigation of multiprocessor structures and algorithms for data base management
A multiprocessor computer architecture for database support
A multiprocessor computer architecture for database support
Petri-Net-Based Modeling and Evaluation of Pipelined Processing of Concurrent Database Queries
IEEE Transactions on Software Engineering
Performance comparison of join on hypercube and mesh
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Performance of join on an n-dimensional mesh
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment
IEEE Transactions on Software Engineering
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
| Hi-index | 0.00 |
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.