ACM Transactions on Database Systems (TODS)
Algorithms to Process Distributed Queries in Fast Local Networks
IEEE Transactions on Computers
Dynamic file migration in distributed computer systems
Communications of the ACM
Improvements to an Algorithm for Equipartitioning
IEEE Transactions on Computers
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.02 |
In this paper, we study the allocation of files in a star network. Unlike previous algorithms which assume that files are independently accessed and independently assigned, the interaction of files during the processing of queries is directly incorporated into our cost model. We present an adaptive algorithm, which is much faster than existing algorithms on file allocation, obtains solutions which are on the average only 0.1 percent away from the optimal solutions, and possesses many desirable properties such as the satisfaction of some necessary and sufficient conditions for file allocation.