Allocation of Operations in Distributed Database Access

Abstract

A model is developed for allocating the operations which are required by a transaction on a distributed database. The model considers the possibility of performing each operation distributedly, i.e., as a set of partial operations performed on different nodes. The criterion of optimality is the minimization of transmission costs. The model is formulated as a linear integer zero-one program. An example is given which shows the use of the model and the advantages of distributed operations.