Allocation of Operations in Distributed Database Access
- 1 February 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (2) , 119-129
- https://doi.org/10.1109/tc.1982.1675957
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.Keywords
This publication has 12 references indexed in Scilit:
- Allocation of Operations in Distributed Database AccessIEEE Transactions on Computers, 1982
- Concurrency Control and Consistency of Multiple Copies of Data in Distributed IngresIEEE Transactions on Software Engineering, 1979
- Query Processing in Distributed Database SystemIEEE Transactions on Software Engineering, 1979
- A Survey of Developments in Distributed Data Base Management SystemsComputer, 1978
- Distributed query processing in a relational data base systemPublished by Association for Computing Machinery (ACM) ,1978
- Optimal program and data locations in computer networksCommunications of the ACM, 1977
- Optimizing the performance of a relational algebra database interfaceCommunications of the ACM, 1975
- Technical Note—Location Theory: A Selective BibliographyOperations Research, 1974
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- A Heuristic Program for Locating WarehousesManagement Science, 1963