Data management in distributed data bases*

The recent advances in large-scale integrated logic and memory technology, coupled with the explosion in size and complexity of the application areas, have led to the design of distributed architectures. Basically, a Distributed Computer System ( DCS ) is considered as an interconnection of digital systems called Processing Elements ( PEs ), each having certain processing capabilities and communicating with each other. This definition encompasses a wide range of configurations from an uniprocessor system with different functional units to multiplicity of general-purpose computers (e.g. ARPANET). In general, the notion of "distributed systems" varies in character and scope with different people. 30 So far, there is no accepted definition and basis for classifying these systems. In this paper, we limit our discussion to a class of DCSs which have an interconnection of dedicated/shared, programmable, functional PEs working on a set of jobs which may be related or unrelated.

[1]  Stephen Todd,et al.  The Peterlee Relational Test Vehicle - A System Overview , 1976, IBM Syst. J..

[2]  Thomas S. Huang.  An upper bound on the entropy of run-length coding (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[3]  J. Spruce Riordon,et al.  Optimal allocation of resources in distributed information networks , 1976, TODS.

[4]  Tien Chi Chen,et al.  Storage-efficient representation of decimal data , 1975, CACM.

[5]  Mary Elizabeth Loomis.  Data base design: object distribution and resource-constrained task scheduling. , 1975 .

[6]  George W. Thomas,et al.  An Algorithm for Compaction of Alphanumeric Data , 1971 .

[7]  R. G. Casey.  Allocation of copies of a file in an information network , 1899 .

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[9]  Sakti P. Ghosh.  Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching , 1976, IEEE Transactions on Software Engineering.

[10]  Geneva G. Belford,et al.  Some theorems to aid in solving the file allocation problem , 1977, CACM.

[11]  T. C. Hu,et al.  Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .

[12]  K. Mani Chandy,et al.  Computational Complexity of Network Design Algorithms , 1977, IFIP Congress.

[13]  Bruce W. Weide,et al.  A Survey of Analysis Techniques for Discrete Algorithms , 1977, CSUR.

[14]  Robert C. Goldstein,et al.  The MacAIMS data management system , 1970, SIGFIDET '70.

[15]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[16]  Kapali P. Eswaran.  Placement of Records in a File and File Allocation in a Computer , 1974, IFIP Congress.

[17]  Michael Stonebraker,et al.  Distributed query processing in a relational data base system , 1978, SIGMOD Conference.

[18]  Eugene Wong,et al.  Decomposition—a strategy for query processing , 1976, TODS.

[19]  K. Dan Levin,et al.  Optimizing distributed data bases: a framework for research , 1975, AFIPS '75.

[20]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[21]  Roger Fajman,et al.  WYLBUR: an interactive text editing and remote job entry system , 1973, CACM.

[22]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[23]  P. J. Titman.  An Experimental Data Base System Using Binary Relations , 1974, IFIP Working Conference Data Base Management.

[24]  Edgar H. Sibley,et al.  Evolution of Data-Base Management Systems , 1976, CSUR.

[25]  K. Dan Levin,et al.  Optimal program and data locations in computer networks , 1977, CACM.

[26]  Shahid H. Bokhari,et al.  Control of Distributed Processes , 1978, Computer.

[27]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.