Query Optimization Method Based on Simulated Annealing Algorithm

A simulated annealing algorithm and query optimization technology, which is applied in the field of relational database query optimization, can solve the problems of reducing search accuracy, prolonging search time, and local extremum cannot search in a wider range, so as to increase the search range and increase the probability , the effect of shortening the relative time of query optimization
CN103336829BInactive Publication Date: 2017-02-15JILIN UNIV
0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
JILIN UNIV
Publication Date
2017-02-15
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention relates to a query optimization method based on a simulated annealing algorithm. The method comprises the steps that a data query optimization process is divided into a model building part, a strategy space resolving part and an optimization part, then the simulated annealing algorithm is led in, all strategy space subsets are searched in a parallel mode, a final solution is obtained from each subset, and the optimal solution is obtained after the final solutions are compared. Compared with other intelligent optimization algorithms, the simulated annealing algorithm can effectively avoid a local extremum and shorten the optimization time. In addition, due to the utilization of parallel searching, the searching range of the simulated annealing algorithm is enlarged, and the influence on searching precision by local search characteristics of the simulated annealing algorithm can be reduced. Compared with the probability for searching an optimal strategy by a traditional local random searching algorithm, the probability for obtaining the optimal strategy by the query optimization method based on the simulated annealing algorithm is improved obviously. The query speed of a database is improved, the relative time of query optimization is shortened, and the probability for obtaining the optimal strategy is improved.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to an optimization method for querying a relational database, in particular to an optimization method for improving the multi-link querying speed of a large-scale relational database. Background technique

[0002] Relational database is a mainstream database based on mathematical concepts. It can directly describe the actual relationship and has high access efficiency. However, the data structure is relatively complicated, especially for large-scale relational databases. With the expansion of the application environment, its stored There are more and more types of data, and the quantity is also increasing, and the data structure becomes extremely complex. When performing multi-link query, the query efficiency is low. In order to enable the large-scale relational database system to respond to user operations in a timely manner and quickly provide query results, query optimization is often performed. Query optimization refers to se...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More