Allocating relations in a distributed database system

Reid D.J. and Orlowska M. (1995) Allocating relations in a distributed database system. Mathematical and Computer Modelling, 22 8: 33-47. doi:10.1016/0895-7177(95)00153-S


Author Reid D.J.
Orlowska M.
Title Allocating relations in a distributed database system
Journal name Mathematical and Computer Modelling   Check publisher's open access policy
ISSN 0895-7177
Publication date 1995-01-01
Sub-type Article (original research)
DOI 10.1016/0895-7177(95)00153-S
Volume 22
Issue 8
Start page 33
End page 47
Total pages 15
Subject 1706 Computer Science Applications
2611 Modelling and Simulation
Abstract A model is proposed that allocates tables of a relational database to the sites of a distributed system in order that the total cost of executing a given collection of join queries is minimized. This model is presented in the convenient form of an integer linear program. Each individual query specifies that several logically distinct data sets, or relations, are to be amalgamated and presented to the particular user that issued the request. Performing this task requires the utilization of limited system resources; both processors, and the communications facilities that interconnect them, may be used. An optimal strategy for executing a single query is, therefore, defined to be one that minimizes a weighted sum of the costs of computation, and those of information interchange, incurred during the computation. One particular model, appearing in [1], conforms to this philosophy, and so forms the basis for further investigations. The total cost of executing an entire group of such queries depends upon the way in which the relevant information is allocated to the sites of the network. Several copies of any particular relation may be dispersed across the network; the replication of data increases its availability, and potentially decreases the costs of answering the given requests. However, only limited storage capacities are available, and increased replication commands greater overheads in maintaining consistency. An optimization program is developed to design a data allocation plan that achieves a minimal total cost for the execution of a given group of requests, while maintaining restraints on the levels of data replication considered permissible.
Keyword Distributed database system
Integer program
Join query
Relational database
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Journal Article
Sub-type: Article (original research)
Collection: Scopus Import - Archived
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 3 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 16 Aug 2016, 11:23:48 EST by System User