A Database Machine for Very Large Relational Databases
IEEE Transactions on Computers
Evaluating two massively parallel machines
Communications of the ACM
NON-VON's performance on certain database benchmarks
IEEE Transactions on Software Engineering
The Architecture of SM3: A Dynamically Partitionable Multicomputer System
IEEE Transactions on Computers
Database processing on a cube-connected multicomputer
Database processing on a cube-connected multicomputer
Implementing Relational Database Operations in a Cube-Connected Multicomputer System
Proceedings of the Third International Conference on Data Engineering
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Dynamic Load Balancing in Very Large Shared-Nothing Hypercube Database Computers
IEEE Transactions on Computers
Efficient parallel algorithms for functional dependency manipulations
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
VLSI Accelerators for Large Database Systems
IEEE Micro
Site and Query Scheduling Policies in Multicomputer Database Systems
IEEE Transactions on Knowledge and Data Engineering
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
IEEE Transactions on Knowledge and Data Engineering
Optimization of Parallel Execution for Multi-Join Queries
IEEE Transactions on Knowledge and Data Engineering
The NUMA with Clusters of Processors for Parallel Join
IEEE Transactions on Knowledge and Data Engineering
A Virtual Bus Architecture for Dynamic Parallel Processing
IEEE Transactions on Parallel and Distributed Systems
Join and Data Redistribution Algorithms for Hypercubes
IEEE Transactions on Knowledge and Data Engineering
A Taxonomy and Performance Model of Data Skew Effects in Parallel Joins
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
| Hi-index | 14.99 |
Distributed memory architectures, specifically hypercubes, for parallel database processing are treated. The cube interconnects support-efficient data combination for the various database operations, and nonuniform data distributions are handled by dynamically redistributing data utilizing these interconnections. Selection and scalar aggregation operations are easily supported. An algorithm for the join operation is discussed in some detail. The cube is compared with another multicomputer database machine, SM3, and the performance of the join operation in these systems is described. The join performance in a cube is comparable to that in SM3 even when the cube is assumed to have a nonuniform data distribution.