File Allocation in Distributed Databases with Interaction between Files

In this paper, we re-examine the file allocation problem. Because of changing technology, the assumptions we use here are different from those of previous researchers. Specifically, the interaction of files during processing of queries is explicitly incorperated into our model and the cost of communication between two sites is dominated by the amount of data transfer and is independent of the receiving and the sending sites. We study the complexity of the file allocation problem using the new model. Unfortunateiy, the problem is NP-hard. We Present an approach to three versions of the problem, thus demonstrating the flexibility of our approach. we further argue that our method provides a practical solution to the problem, because accurate solutions are obtained, the time complexity cf our algorithm is much smaller than existing algorithms, the algorithm is conceptually simple, easy to implement and is adaptive to users ’ changing access patterns. Sectio