Data allocation in distributed database systems

Data allocation in distributed database systems (1988)

by Peter M. G. Apers

Venue:	ACM Transactions on Database Systems
Citations:	61 - 1 self

Datum	Value	Source
TITLE	Data allocation in distributed database systems	INFERENCE
AUTHOR NAME	Peter M. G. Apers	SVM HeaderParse 0.2
ABSTRACT	The problem of allocating the data of a database to the sites of a communication network is investigated. This problem deviates from the well-known file allocation problem in several aspects. First, the objects to be allocated are not known a priori; second, these objects are accessed by schedules that contain transmissions between objects to produce the result. A model that makes it possible to compare the cost of allocations is presented, the cost can be computed for different cost functions and for processing schedules produced by arbitrary query processing algorithms. For minimizing the total transmission cost, a method is proposed to determine the fragments to be allocated from the relations in the conceptual schema and the queries and updates executed by the users. For the same cost function, the complexity of the data allocation problem is investigated. Methods for obtaining optimal and heuristic solutions under various ways of computing the cost of an allocation are presented and compared. Two different approaches to the allocation management problem are presented and their merits are discussed.	SVM HeaderParse 0.2
YEAR	1988	INFERENCE
VENUE	ACM Transactions on Database Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	263--304	INFERENCE
VOLUME	13	INFERENCE
CITATIONS	43 found	ParsCit 1.0