The problem of file allocation is a very important problem in designing a distributed database. In this thesis, the problem of allocating file nonredundantly has been dealt with. An algorithm for the nonreplicated allocation of files is proposed. This algorithm can be used for the partitioned allocation of files as well as for the non-partitioned allocation of files. And this algorithm considers the interaction between files by allowing a query or an update to refer several files. It has been shown that the proposed algorithm is computationally feasible and its solution is near optimal. Two properties of the proposed algorithm are shown to guarantee the convergence of the algorithm. The proposed algorithm is flexible and easy to impement since it obtains a solution by the location adjustment for files one at a time. The proposed algorithm is implemented in PASCAL.