Query optimization in a distributed hypercube database

Abstract—Classical work on query optimization has not taken account of the topology of distributed database networks as a cost factor in executing standard operations in relational algebra. Here we report research findings designed to help remedy this deficiency. In particular, we examine the relative costs of query optimization (a) in a network whose topology (e.g., a hypercube) is known and (b) in a network (e.g., a Gaian database under preferential attachment) whose topology is unknown. The critical factor in the advantage of a well defined topology is that the cost of determining pairwise distances between the nodes involved in a join operation is substantially lower than it is in a network whose topology is unknown. What is more the cost of building and maintaining a hypercube is comparable to the management costs in a random network based on preferential attachment. I