Different ways of distributing relational data are described and studied according to the manipulation operators: get, insert, delete, update tuples. In a distributed DBMS, distributed relations are split into fragmen...
详细信息
Different ways of distributing relational data are described and studied according to the manipulation operators: get, insert, delete, update tuples. In a distributed DBMS, distributed relations are split into fragments which are spread over several computers, but the user sees them as if they were in a centralized database. When a manipulation operation takes place on a distributed relation, it has to be propagated onto the underlying fragments. We propose a formalism to express this propagation. This formalism not only expresses what operations have to be performed but how these operations can be performed, i. e. in sequence and/or parallel.
The problem of the combined communication network design and file allocation for distributeddatabases is addressed. It consists of finding the allocation of database files over a set of computer sites and of the desi...
详细信息
The problem of the combined communication network design and file allocation for distributeddatabases is addressed. It consists of finding the allocation of database files over a set of computer sites and of the design of the communication network, i. e. , the design of the network topology, and the allocation of the communication channel capacities. The objective is to minimize the total cost of storing the database files and of leasing the communication channels subject to the constraints of network reliability, file availability, and communication delay. The network topologies are restricted to be of maximal connectivity and minimal diameter. A heuristic algorithm to solve the problem is described and some results are presented.
Different ways of distributing relational data are described and studied according to the manipulation operators: get, insert, delete, update tuples. In a distributed DBMS, distributed relations are split into fragmen...
详细信息
Different ways of distributing relational data are described and studied according to the manipulation operators: get, insert, delete, update tuples. In a distributed DBMS, distributed relations are split into fragments which are spread over several computers, but the user sees them as if they were in a centralized database. When a manipulation operation takes place on a distributed relation, it has to be propagated onto the underlying fragments. We propose a formalism to express this propagation. This formalism not only expresses what operations have to be performed but how these operations can be performed, i. e. in sequence and/or parallel.
This conference proceedings contains 55 papers. Fifty-two papers are indexed separately. The topics covered are: distributedsystems structure;architecture;semantics of parallel programming;distributed data bases;perf...
详细信息
This conference proceedings contains 55 papers. Fifty-two papers are indexed separately. The topics covered are: distributedsystems structure;architecture;semantics of parallel programming;distributed data bases;performance analysis;security and reliability;distributed scheduling;local area networks;language constructs;and applications.
The problem of the combined communication network design and file allocation for distributeddatabases is addressed. It consists of finding the allocation of database files over a set of computer sites and of the desi...
详细信息
The problem of the combined communication network design and file allocation for distributeddatabases is addressed. It consists of finding the allocation of database files over a set of computer sites and of the design of the communication network, i. e. , the design of the network topology, and the allocation of the communication channel capacities. The objective is to minimize the total cost of storing the database files and of leasing the communication channels subject to the constraints of network reliability, file availability, and communication delay. The network topologies are restricted to be of maximal connectivity and minimal diameter. A heuristic algorithm to solve the problem is described and some results are presented.
Multicomputer systems with distributed control form an architecture that simultaneously satisfies such design goals as high performance through parallel operation of VLSI processors, modular extensibility, fault toler...
详细信息
This conference proceedings contains 55 papers. Fifty-two papers are indexed separately. The topics covered are: distributedsystems structure; architecture; semantics of parallel programming; distributed data bases; ...
详细信息
This conference proceedings contains 55 papers. Fifty-two papers are indexed separately. The topics covered are: distributedsystems structure; architecture; semantics of parallel programming; distributed data bases; performance analysis; security and reliability; distributed scheduling; local area networks; language constructs; and applications.
The proceedings contain 23 papers. The special focus in this conference is on Programming. The topics include: About program termination and simplification;foreword;static type checking for languages with parametric t...
ISBN:
(纸本)9783540099819
The proceedings contain 23 papers. The special focus in this conference is on Programming. The topics include: About program termination and simplification;foreword;static type checking for languages with parametric types and polymorphic procedures;a relational model for non-deterministic programs and predicate transformers;structures de controle et puissances d'expression;conception et optimisation des descentes recursives;an algebraic structure of petri nets;An algorithm for translating LISP programs into reduction language programs;concurrent operations in large ordered indexes;specification of highly parallel and distributed resource management;semantics for lisp without reference to an interpreter;parallelism in ADA: Program design and meaning;the theory and practice of transforming call-by-need into call-by-value;concrete control phases in languages for programming complex systems;a model-theoretic approach to specification, extension, and implementation;Échappements et continuations en semantique dénotationnelle;suggestions for composing and specifying program design decisions;making programs more readable;types algebriques et semantique des langages de programmation;towards a theory of abstract data types: A discussion on problems and tools;on relations between programs.
暂无评论