基于限定性约束条件的数据库访问优化设计

Database Access Optimization Design Based on Defining Constraints

消除对数据库进行数据查询时的冗余干扰对构建和开发基于数据库的应用具有重要意义。由于数据库访问数据量的增加,使得出现接口不统一的现象,传统的访问算法主要通过加入约束条件的方法加强访问接口的统一,但只加快了查询的速度,忽略了加入约束条件使得迭代计算量大,导致访问效率低的问题。提出基于限定性约束条件的数据库访问优化设计方法。先利用博弈方法对层次数据进行细分,在确定各类数据结构的过程,将其用于描述对数据库整体数据的结构划分,在融合限定性约束的概念,建立数据库的数据挖掘模型,将数据库的数据挖掘问题转换为在最小二乘准则下的规划问题,获取数据库的数据挖掘目标函数,计算出数据挖掘最优解,完成数据库访问优化设计。实验仿真证明,基于限定性约束条件的数据库访问优化设计方法设计性能较为优越,且灵活高效。

An optimization design method for database access based on restrictive constraints is proposed. Firstly, the game method is used to subdivide the hierarchical data, in the process of determining the various types of data structures, which is used to describe the structure division of the whole data in database. Then, the definition of restrictive constraints is integrated, and the data mining model of database is established. The data mining problem in the database is converted to the planning problem under the least square criterion, the target function of data mining in database is obtained, the optimal solution of data mining is calculated, and the database access optimization design is completed. The simulation results show that the proposed optimization design method has good performance, which is flexible and efficient.