The tutorial focuses on hypercube interconnected architectures as a computational engine for relational-database processing. Several implementations of the many currently available hypercube systems are highlighted, and comments on their potential performance in evaluating relational-database operators are presented. All algorithms assume that the relevant data are memory resident. Experimental timings obtained from a portable hypercube-based database system are presented to characterize performance potential for various uniscan and multiscan operations.<>