1. Data Allocation and Distributed Query Processing.;Apers;Proc. ACM Pacific Conf.,1980
2. Apers, P. (1982). Query Processing and Data Allocation in Distributed Database Systems, Ph.D. Thesis, Vrije Universiteit, Amsterdam. With a prior knowledge of query processing strategies, Apers uses a graphing technique to build a data flow model of the distributed system. Strategy graphs with virtual sites are used to model query processing costs associated with a given file allocation. Links are drawn between relations if data is transmitted between them in queries. The heuristic optimization algorithm clusters relations and then assigns the clusters to virtual sites to minimize data transmission cost. Another heuristic determines to which physical sites the virtual sites will be allocated.
3. A Record and File Partitioning Model.;Babad;Comm. ACM.,1977
4. Concurrency Control in Distributed Database Systems.;Bernstein;ACM Comput. Surv.,1981
5. Allocation of Copies of Files in an Information Network.;Casey;AFIPS Spring Joint Computer Conf.,1972