Abstract
A File allocation problem is studied in this paper. The problem formulated is to minimize transmission cost where the constraints are the number of files and the number of copies. The transmission cost also reflects concurrency control cost which is essential in a distributed database system. It is demonstrated that an optimal solution can be found by transforming this problem to a network flow problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. A. Bernstein, D. W. Shipman, and J. B. Rothnie, Jr., “Concurrency Control in a System for Distributed Databases (SDD-1),”ACM Transactions on Database Systems 5 (1):18–51 (1980).
R. G. Casey, “Allocation of Copies of a File in an Information Network,”SJCC, AFIPS Conference Proceedings (Washington, Thomson Books, 1972).
S. K. Chang, “Database Decomposition in a Hierarchical Computer System,”ACM SIGMOD Proceedings 48–52 (1972).
S. K. Chang, M. O'Brien, J. Read, R. Borovec, W. H. Cheng, and J. S. Ke, “Design Consideration of a Data Base System in a Clinical Network Environment,”Proceedings of the National Computer Conference (IEEE, New York, 1976), pp. 277–286.
S. K. Chang and W. H. Cheng, “A Methodology for Structured Database Decomposition,”IEEE Transactions on Software Engineering 6 (2):205–218 (1980).
S. K. Chang and A. C. Liu, “A Database File Allocation Problem,”Proceedings IEEE COMPSAC'81, pp. 18–23 (1981).
W. W. Chu, “Optimal file allocation in a multiple computer system,”IEEE Transactions on Computers 18 (10):885–889 (October, 1969).
E. F. Codd, “A Relational Model of Data for Large Shared Data Banks,”Communication of the ACM 13 (6):377–387 (1970).
Umeshwar Dayal and P. A. Bernstein, “The Fragmentation Problem: Lossless Decomposition of Relations into Files,” Technical Report CCA-78-13, Computer Corporation of America, November 1978.
K. P. Eswaran, “Placement of Records in a File and File Allocation in a Computer Network,”IFIP Conference Proceedings (Stockholm, Sweden, 1974), pp. 304–307.
K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, “The Notions of Consistency and Predicate Locks in a Database System,”Communications of the ACM 19 (11):624–633 (November 1976).
L. R. Ford and D. R. Fulkerson,Flows in Networks (Princeton Press, Princeton, 1962).
Paul Jensen and J. Wesley Barnes,Network Flow Programming (John Wiley and Sons, Inc., New York, 1980).
K. Lam and C. T. Yu, “An Approximation Algorithm for a File-Allocation Problem in a Hierarchical Distributed System,”Proceedings of ACM-SIGMOD 1980, International Conference on Management of Data (Santa Monica, California, 1980).
H. L. Morgan and K. D. Levin, “Optimal Program and Data Locations in Computer Networks,” Research Report 74-10-01, Dept. of Decision Sciences, University of Pennsylvania, 1974.
E. Minieka,Optimization Algorithms for Networks and Graphs (Marcel Dekker, Inc., New York, 1978).
D. M. Ritchie and K. Thompson, “The UNIX Time-Sharing System,”The Bell System Technical Journal 57 (6), part 2, 1905–1929 (1978).
J. B. Rothnie and N. Goodman, “An Overview of the Preliminary Design of SDD-1: A System for Distributed Databases,” 1977 Berkeley Workshop on Distributed Data Management and Computer Networks, Lawrence Berkeley Laboratory, University of California, Berkeley, California, May 1977, 39–57.
J. B. Rothnie and N. Goodman, “A Survey of Research and Development in Distributed Database Management,”1977 ACM Proceedings on Very Large Data Bases (Tokyo, 1977), pp. 48–62.
R. H. Thomas, “A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases,”ACM Transactions on Database Systems 4 (2):180–209 (1979).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chang, SK., Liu, AC. File allocation in a distributed database. International Journal of Computer and Information Sciences 11, 325–340 (1982). https://doi.org/10.1007/BF01001955
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01001955