DISTRIBUTED DATABASE DESIGN OPTIMIZATION VS FEASIBILITY

作     者：MOTZKIN, D 

作者机构：Department of Computer Science Western Michigan UniversityKalamazoo MI 49008 U.S.A. 

出 版 物：《INFORMATION SYSTEMS》 (信息系统)

年 卷 期：1990年第15卷第6期

页      面：615-625页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：WesternM ichigan University  (FRF 88-079) 

主　　题：DISTRIBUTED DATABASE DESIGN DISTRIBUTED DATA ALLOCATION DATABASE DESIGN OPTIMIZATION FILE ASSIGNMENT PROBLEM 

摘      要：This paper is concerned with the problem of optimal assignment of data to sites in a distributed relational database. It is shown that in general the optimal allocation will require exponential time in terms of the input. Several heuristic algorithms that can be applied to various constraints and which provide feasible, near optimal results, as well as a model that determines the best assignment for a given input out of several optimal and near optimal assignments have been developed. The model is shown to be efficient, to require polynomial time, to be practical in term of feasible inputs and to achieve assignments with near minimal global and local costs.