Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Group-Based Global Multi-Query Optimization Method

An optimization method and multi-query technology, applied in the field of database multi-query optimization, can solve problems such as inability to deal with uncertain similarities between queries

Active Publication Date: 2020-12-15
ZHEJIANG HONGCHENG COMP SYST
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the traditional multi-query optimization is only suitable for the scene of strong similarity multi-query input, and cannot deal with the situation where the similarity between queries is uncertain

Method used

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
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Group-Based Global Multi-Query Optimization Method
  • A Group-Based Global Multi-Query Optimization Method
  • A Group-Based Global Multi-Query Optimization Method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0055] Example: such as figure 1 As shown, a global multi-query optimization method based on grouping includes two stages of multi-query modeling and multi-query optimization. The specific steps are as follows:

[0056] Multiple query modeling phase:

[0057] The flowchart of multi-query modeling is as follows figure 2 As shown, the main steps include:

[0058] Step 1, for the given n query statements The lexical analysis tool JFlex is used for lexical analysis, and the result is input to the grammatical analysis tool CUP for grammatical analysis.

[0059] Step 2, use the query optimizer based on the volcano model to perform n query statements Q={q 1 ,q 2 ,...,q n}Plan enumeration to get each query statement q i The corresponding j plans P i ={p i1 ,p i2 ,...,p ij}.

[0060] Plan enumeration of queries, and use the query optimizer based on the volcano model for each query q i Enumerate all j plans P i ={p i1 ,p i2 ,...,p ij}. Such as image 3 As shown, for...

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

PUM

No PUM Login to View More

Abstract

The invention relates to a grouping-based global multi-query optimization method, comprising the specific steps of 1) establishing signatures for query statements of an input system; 2) grouping the query statements according to the signatures; 3) performing cost estimation on a query plan in each group to select a plan; 4) combining the plans selected in the groups to finally obtain multiple global plans. By establishing the query signatures in conjunction with the grouping theory, it is ensured that optimal global plans are acquired within a shortest time, and multi-query optimization efficiency is thereby improved. The method of the invention has a promising application prospect in data statistics, data mining, report generating, online query and other fields based on the big data background.

Description

technical field [0001] The invention relates to the technical field of database multi-query optimization, in particular to a group-based global multi-query optimization method. Background technique [0002] Database query optimization (Query Optimization) has a long history. From the stand-alone database decades ago to the current distributed big data platform, many query optimization technologies have been derived. Early query optimization focused on a single query. The query optimizer will choose from all possible query plans the most efficient way to execute a given query. With the enrichment of usage scenarios and changes in various application requirements, the high-concurrency query scenarios that the system needs to cope with have increased dramatically. Faced with a large number of similarity queries that may appear in the scene, the system can only process them one by one, and cannot speed up the entire process by utilizing the shareable parts between queries. Th...

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

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/2453G06F16/2452
CPCG06F16/2452G06F16/24542G06F16/24545
Inventor 吴勇陈岭林言钟宏泽
Owner ZHEJIANG HONGCHENG COMP SYST
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products