基于分治策略的数据库查询优化设计与实现  

Design and Implementation of Database Query Optimization Based on Divide and Conquer Method

作　　者：颜丽 YAN Li(School of Information and Computer Engineering,Pingxiang University,Pingxiang Jiangxi 337000,China)

机构地区：[1]萍乡学院信息与计算机工程学院,江西萍乡337000

出　　处：《萍乡学院学报》2018年第3期66-68,73,共4页Journal of Pingxiang University

摘　　要：目前常用的多表查询算法虽然空间复杂度较好,但是时间复杂度较高。为了解决上述问题,需要一种新的查询多表方案,采用不同的查询结果生成算法来避免时间复杂度高的情况发生。文章设计了分治策略的数据库查询新算法,将原问题分成n个规模较小而结构与原问题相似的子问题,逐步或递归地解决这些子问题。从而逐步生成所需要的查询结果,在保证了较好空间复杂度的同时也使时间复杂度大大降低。Multi-table query algorithm has better spatial complexity but higher time complexity. In order to solve these problems, we need a new query multi table scheme that uses generating different query results of algorithm to avoid the time complexity. In the paper, a new database query algorithm based on divide and conquer method is designed, by which the original problem is divided into numeral sub problems with smaller size and original structure, and these sub problems are solved recursively or step by step. Thus the query results are gradually generated, which ensures space complexity and greatly reduces the time complexity.

关 键 词：数据库 多表查询 时间复杂度 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]