An Iterative Method for Distributed Database Design

The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and data allocation on distrihuled systemsare well recognizedbut little understood. We investigatethesedependenciesby proposingandanalyzingan iterativeheuristic which providesan integrated solution lo the query optimization and data allocation problems, The optimization heuristic itcrates between finding minimum cost query slrategiesand minimum cost data allocations until a local minimum for the combinedproblem is found. A searchfrom convergenceefficiently scansthe optimization searchspacefor lower cost solutions. Parametric studies within a simplequery environmentdemonstratenearoptimal performancefor the iterativemethod when minimizing lolal timeand responsecost of queries. The iterative method provides clear improvementsover alternativesolution methods. The paper concludes with the practical implications of thi...

• Type: Conference
• Year: 1991
• Where: VLDB
• Authors: Rex Blankinship, Alan R. Hevner, S. Bing Yao
• Keywords: Data Allocations, Database, Minimum Cost, Query Optimization, VLDB 1991