An iterative method for distributed database optimization

作     者：Blankinship, R Hevner, AR Yao, SB 

作者机构：UNIV S FLORIDA COLL BUSINESS ADM TAMPA FL 33620 USA UNIV MARYLAND COLL BUSINESS & MANAGEMENT COLLEGE PK MD 20742 USA 

出 版 物：《DATA & KNOWLEDGE ENGINEERING》 (数据与知识工程)

年 卷 期：1996年第21卷第1期

页      面：1-30页

核心收录：

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

主　　题：distributed database systems query optimization file allocation distributed database design simulation 

摘      要：The development of a distributed database system requires effective solutions to many complex and interrelated design optimization problems. The cost dependencies between query optimization and data allocation on distributed systems are well recognized but little understood. We investigate these dependencies by proposing and analysing an iterative heuristic which provides an integrated solution to the query optimization and data allocation problems. The optimization heuristic iterates between finding minimum-cost query strategies and minimum-cost data allocations until a local minimum for the combined problem is found. A search from convergence efficiently scans the optimization search space for lower-cost solutions. In this paper, we apply the iterative heuristic to a realistic distributed database system model and a general class of queries and obtain very significant performance benefits. Experimental results demonstrate clear improvements in performance for the iterative method over existing design methods in a general-query environment. The iterative heuristic is proposed as a framework for future research extensions to achieve distributed system optimization.