WO2017091925A1 - 数据查询的方法、装置和数据库系统 - Google Patents
数据查询的方法、装置和数据库系统 Download PDFInfo
- Publication number
- WO2017091925A1 WO2017091925A1 PCT/CN2015/095909 CN2015095909W WO2017091925A1 WO 2017091925 A1 WO2017091925 A1 WO 2017091925A1 CN 2015095909 W CN2015095909 W CN 2015095909W WO 2017091925 A1 WO2017091925 A1 WO 2017091925A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- connection
- predicate
- query plan
- join
- level
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
- G06F16/24534—Query rewriting; Transformation
- G06F16/24542—Plan optimisation
- G06F16/24544—Join order optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
- G06F16/24534—Query rewriting; Transformation
- G06F16/24542—Plan optimisation
- G06F16/24545—Selectivity estimation or determination
Definitions
- the query plan enumeration algorithm to enumerate all candidate query plans for the original query plan, using typical enumeration algorithms such as those used in IBM System R. Dynamic programming algorithm.
- recombining the join predicates in the original query plan includes:
- the left outer join is an extension of the inner join. It differs from the inner join in that if the R and S tables are left outer joins, if the left table (ie, the table R) is in the right table S did not find a matching row that matches the join predicate. Unlike an inner join, the record is discarded directly.
- the left outer join still returns a record that retains all the column values in the left table, but all columns from the right table. The values are all empty (NULL).
- the right outer join is similar to the left outer join. The only difference is that if a row in the right table does not find a matching row in the left table, then all the columns from the left table in the record returned by the operation. The values are all empty.
- a full outer join is similar to a left/right outer join. The only difference is that no match row is found for a row in the left or right table, the operation returns a record and the column of the matching table is missing from the record. The values are all empty.
- the basic information of the predicate p includes:
- S1160 Determine, according to a connection operation rule, a constraint condition of the recombined connection predicate of the original query plan.
- o A is in the right subtree of the subtree with o B as the root node. If o A and o B do not satisfy the combination of the operation level and the predicate level, then each of the reorganized on o B The connection predicate adds a second constraint. If o A and o B do not satisfy the right permutation rule of the operation level and the right permutation rule of the predicate level, a first constraint condition is added for each recombination predicate on o B ;
- the set of equivalent query plans may be determined in the candidate query plan set, that is, whether each candidate query plan is original Query the plan's equivalent query plan; if there is no candidate query plan set, you can get a candidate query plan from the original query plan each time, and determine whether the candidate query plan is the equivalent query plan of the original query plan.
- the first candidate query plan P' herein may be any candidate query plan in the candidate query plan.
- a query plan can be selected from the set of equivalent query plans for querying. That is, select the query plan to query in the previously obtained equivalent query plan set. Specifically, the query plan with the least cost can be selected from the set of equivalent query plans to perform the query, and the query result is returned.
- the set of equivalent query plans includes all query plans that can be converted from the original query plan by at least one of the four operational level rules and the three predicate level rules.
- the above steps S1140-S1170 give an equivalent query to determine the original query plan.
- the method of drawing. The method of determining the equivalent query plan of the original query plan is described in detail below with reference to specific examples. It should be noted that this is only to assist those skilled in the art to better understand the embodiments of the present invention and not to limit the scope of the embodiments of the present invention.
- connection predicate in the original query plan P includes a total of three join operations (ie ⁇ p14 ⁇ p34 , P23 and ⁇ p12 ).
- join operation ⁇ p14 ⁇ p34 since the join operation is an inner join, its predicate needs to be converted into a conjunction paradigm (the join paradigm of p14 ⁇ p34 is itself), since the input tables of p14 and p34 are not the same, They cannot be combined into one predicate.
- connection operations P23 since the join operation is not an inner join, its predicate (ie p23) is treated as a predicate.
- the size of the sequence numbers of the above processes does not mean the order of execution, and the order of execution of each process should be determined by its function and internal logic, and should not be directed to the embodiments of the present invention.
- the implementation process constitutes any limitation.
- the apparatus 1700 may further include:
- the determining module 1750 is specifically configured to: in accordance with the basic information of the recombined connection predicate of the original query plan and the constraint condition of the recombined connection predicate of the original query plan, in the candidate query plan set. Determine the set of equivalent query plans.
- the basic information of the connection predicate includes an input table of the connection predicate, and the connection predicate is located in an input table of the connection predicate included in a left subtree of the concatenation operation, where the connection predicate is located.
- the connection operation rule includes an operation level rule and a predicate level rule
- the combination of operational levels (e 1 o a p12 e 2 )o b p23 e 3 e 1 o a p12 (e 2 o b p23 e 3 )
- the right permutation rule of the operation level e 1 o a p13 (e 2 o b p23 e 3 ) e 2 o b p23 (e 1 o a p13 e 3 )
- the rules of the predicate level include the binding rules of the
- o A is in the right subtree of the subtree with o B as the root node. If o A and o B do not satisfy the combination of the operation level and the predicate level, then each of the reorganized on o B The connection predicate adds a second constraint. If o A and o B do not satisfy the right permutation rule of the operation level and the right permutation rule of the predicate level, a first constraint condition is added for each recombination predicate on o B ;
- the determining module 1750 is specifically configured to:
- connection type of each first connection operation of P' is an inner connection
- the first connection operation is a connection operation having two or more recombined connection predicates, and each of the two or more recombined connection predicates
- the connection type of the connection operation of the predicate in P is an inner connection
- the apparatus 1700 for data query according to an embodiment of the present invention may correspond to an execution body of a method of data query according to an embodiment of the present invention, and the above and other operations and/or functions of respective modules in the apparatus 1700 are respectively implemented to implement the foregoing respective methods.
- the corresponding process, for the sake of brevity, will not be described here.
- FIG. 18 shows a schematic block diagram of a database system 1800 in accordance with an embodiment of the present invention.
- the database system 1800 includes the device 1700 and database 1810 for data query of the foregoing embodiments of the present invention.
- the database system 1800 can perform the method of data query of the foregoing embodiment of the present invention, and perform a query in the database 1810.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Operations Research (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
内连接 | 左半连接 | 左反连接 | 左外连接 | 全外连接 | |
内连接 | + | + | + | + | - |
左半连接 | - | - | - | - | - |
左反连接 | - | - | - | - | - |
左外连接 | - | - | - | +1 | - |
全外连接 | - | - | - | +1 | +2 |
内连接 | 左半连接 | 左反连接 | 左外连接 | 全外连接 | |
内连接 | + | + | + | + | - |
左半连接 | + | + | + | + | - |
左反连接 | + | + | + | + | - |
左外连接 | + | + | + | + | +1 |
全外连接 | - | - | - | +2 | +3 |
内连接 | 左半连接 | 左反连接 | 左外连接 | 全外连接 | |
内连接 | + | - | - | - | - |
左半连接 | - | - | - | - | - |
左反连接 | - | - | - | - | - |
左外连接 | - | - | - | - | - |
全外连接 | - | - | - | - | +1 |
内连接 | 左半连接 | 左反连接 | 左外连接 | 全外连接 | |
内连接 | + | - | - | - | - |
左半连接 | - | - | - | - | - |
左反连接 | - | - | - | - | - |
左外连接 | - | - | - | - | - |
全外连接 | - | - | - | - | - |
p | T(p) | Tl(p) | Tr(p) | O(p) |
p14 | {R1,R4} | {R1} | {R4} | 内连接 |
p34 | {R3,R4} | {R3} | {R4} | 内连接 |
p23 | {R2,R3} | {R2} | {R3} | 左反连接 |
p12 | {R1,R2} | {R1} | {R2} | 内连接 |
p | 约束条件 |
p14 | R3->R2 |
p34 | R3->R2 |
p23 | 无 |
p12 | 无 |
Claims (20)
- 一种数据查询的方法,其特征在于,由数据库系统执行,所述数据库系统运行在计算机设备上,所述方法包括:接收数据查询请求;根据所述数据查询请求,生成原始查询计划;重组所述原始查询计划中的连接谓词;确定所述原始查询计划的重组后的连接谓词的基本信息;基于连接操作规则,确定所述原始查询计划的重组后的连接谓词的约束条件;根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,确定所述原始查询计划的等价查询计划;根据所述原始查询计划的等价查询计划进行查询。
- 根据权利要求1所述的方法,其特征在于,所述根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,确定所述原始查询计划的等价查询计划,包括:根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,确定所述原始查询计划的等价查询计划集合;所述根据所述原始查询计划的等价查询计划进行查询,包括:从所述等价查询计划集合中选择查询计划进行查询。
- 根据权利要求2所述的方法,其特征在于,所述方法还包括:根据所述原始查询计划,获取候选查询计划集合;所述根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,确定所述原始查询计划的等价查询计划集合,包括:根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,在所述候选查询计划集合中确定所述等价查询计划集合。
- 根据权利要求1至3中任一项所述的方法,其特征在于,所述重组所述原始查询计划中的连接谓词,包括:对于所述原始查询计划中的内连接操作,将所述内连接操作的所有连接谓词转化成合取范式并合并具有相同输入表的连接谓词;对于所述原始查询计划中的非内连接操作,将所述非内连接操作的所有连接谓词合并成一个连接谓词。
- 根据权利要求1至4中任一项所述的方法,其特征在于,所述连接谓词的基本信息包括所述连接谓词的输入表,所述连接谓词所在连接操作的左子树中包括的所述连接谓词的输入表,所述连接谓词所在连接操作的右子树中包括的所述连接谓词的输入表和所述连接谓词所在连接操作的连接类型。
- 根据权利要求1至5中任一项所述的方法,其特征在于,所述连接操作规则包括操作级别的规则和谓词级别的规则,其中,所述操作级别的规则包括操作级别的交换规则e1oa p12e2=e2oa p12e1、操作级别的结合规则(e1oa p12e2)ob p23e3=e1oa p12(e2ob p23e3)、操作级别的左置换规则(e1oa p12e2)ob p13e3=(e1ob p13e3)oa p12e2和操作级别的右置换规则e1oa p13(e2ob p23e3)=e2ob p23(e1oa p13e3),所述谓词级别的规则包括谓词级别的结合规则(e1oa p12e2)ob p∧p23e3=e1oa p12∧p(e2ob p23e3)、谓词级别的左置换规则(e1oa p12e2)ob p13∧pe3=(e1ob p13e3)oa p12∧pe2和谓词级别的右置换规则e1oa p∧p13(e2ob p23e3)=e2ob p∧p23(e1oa p13e3),其中,ei为查询表达式,oa,ob为连接操作,pij为ei和ej之间的连接谓词。
- 根据权利要求6所述的方法,其特征在于,所述基于连接操作规则,确定所述原始查询计划的重组后的连接谓词的约束条件,包括:对于所述原始查询计划中的每个连接操作节点oB,遍历以oB为根节点的子树中的每一个连接操作节点oA,oA在以oB为根节点的子树的左子树中时,若oA和oB不满足操作级别的结合规则和谓词级别的结合规则,则为oB上的重组后的每个连接谓词添加第一约束条件,若oA和oB不满足操作级别的左置换规则和谓词级别的左置换规则,则为oB上的重组后的每个连接谓词添加第二约束条件;oA在以oB为根节点的子树的右子树中时,若oA和oB不满足操作级别的结合规则和谓词级别的结合规则,则为oB上的重组后的每个连接谓词添加第二约束条件,若oA和oB不满足操作级别的右置换规则和谓词级别的右置换规则,则为oB上的重组后的每个连接谓词添加第一约束条件;所述第一约束条件为T(e2)->T(e1)∩T(pa1∧pa2∧…∧pan),所述第二约束 条件为T(e1)->T(e2)∩T(pa1∧pa2∧…∧pan),T(e1)表示以oA为根节点的子树的左子树e1包括的原始输入表,T(e2)表示以oA为根节点的子树的右子树e2包括的原始输入表,T(pa1∧pa2∧…∧pan)表示oA上的重组后的连接谓词pa1∧pa2∧…∧pan中包括的原始输入表,T1->T2表示若以T1->T2所约束的连接谓词所在的连接操作为根节点的第一子树包括T1中的任意一个输入表,则所述第一子树包括T2中的所有输入表。
- 根据权利要求1至7中任一项所述的方法,其特征在于,所述根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,确定所述原始查询计划的等价查询计划,包括:若第一候选查询计划P’满足以下条件,则确定P’为所述原始查询计划P的等价查询计划:P’的每个第一连接操作的连接类型是内连接,所述第一连接操作为具有两个以上重组后的连接谓词的连接操作,且所述两个以上重组后的连接谓词中的每个连接谓词在P中所对应的连接操作的连接类型是内连接;对于P’中每个连接操作ob’上的每个连接谓词p,在ob’不满足操作级别的交换规则时,P’中的Tl(p)和P中的Tl(p)相等且P’中的Tr(p)和P中的Tr(p)相等,其中,Tl(p)表示p所在连接操作的左子树中包括的p的输入表,Tr(p)表示p所在连接操作的右子树中包括的p的输入表,在ob’满足操作级别的交换规则时,P’中的Tl(p)和P中的Tl(p)相等且P’中Tr(p)和P中的Tr(p)相等,或者P’中的Tl(p)和P中的Tr(p)相等且P’中的Tr(p)和P中的Tl(p)相等;对于P’中每个连接操作ob’上的每个连接谓词p,p满足p在P中的约束条件。
- 根据权利要求2所述的方法,其特征在于,所述从所述等价查询计划集合中选择查询计划进行查询,包括:从所述等价查询计划集合中选择代价最小的查询计划进行查询。
- 一种数据查询的装置,其特征在于,包括:接收模块,用于接收数据查询请求;生成模块,用于根据所述数据查询请求,生成原始查询计划;重组模块,用于重组所述原始查询计划中的连接谓词;确定模块,用于确定所述原始查询计划的重组后的连接谓词的基本信息;基于连接操作规则,确定所述原始查询计划的重组后的连接谓词的约束条件;以及根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,确定所述原始查询计划的等价查询计划;查询模块,用于根据所述原始查询计划的等价查询计划进行查询。
- 根据权利要求10所述的装置,其特征在于,所述确定模块具体用于,根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,确定所述原始查询计划的等价查询计划集合;所述查询模块具体用于,从所述等价查询计划集合中选择查询计划进行查询。
- 根据权利要求11所述的装置,其特征在于,所述装置还包括:获取模块,用于根据所述原始查询计划,获取候选查询计划集合;所述确定模块具体用于,根据所述原始查询计划的重组后的连接谓词的基本信息和所述原始查询计划的重组后的连接谓词的约束条件,在所述候选查询计划集合中确定所述等价查询计划集合。
- 根据权利要求10至12中任一项所述的装置,其特征在于,所述重组模块具体用于:对于所述原始查询计划中的内连接操作,将所述内连接操作的所有连接谓词转化成合取范式并合并具有相同输入表的连接谓词;对于所述原始查询计划中的非内连接操作,将所述非内连接操作的所有连接谓词合并成一个连接谓词。
- 根据权利要求10至13中任一项所述的装置,其特征在于,所述连接谓词的基本信息包括所述连接谓词的输入表,所述连接谓词所在连接操作的左子树中包括的所述连接谓词的输入表,所述连接谓词所在连接操作的右子树中包括的所述连接谓词的输入表和所述连接谓词所在连接操作的连接类型。
- 根据权利要求10至14中任一项所述的装置,其特征在于,所述连接操作规则包括操作级别的规则和谓词级别的规则,其中,所述操作级别的 规则包括操作级别的交换规则e1oa p12e2=e2oa p12e1、操作级别的结合规则(e1oa p12e2)ob p23e3=e1oa p12(e2ob p23e3)、操作级别的左置换规则(e1oa p12e2)ob p13e3=(e1ob p13e3)oa p12e2和操作级别的右置换规则e1oa p13(e2ob p23e3)=e2ob p23(e1oa p13e3),所述谓词级别的规则包括谓词级别的结合规则(e1oa p12e2)ob p∧p23e3=e1oa p12∧p(e2ob p23e3)、谓词级别的左置换规则(e1oa p12e2)ob p13∧pe3=(e1ob p13e3)oa p12∧pe2和谓词级别的右置换规则e1oa p∧p13(e2ob p23e3)=e2ob p∧p23(e1oa p13e3),其中,ei为查询表达式,oa,ob为连接操作,pij为ei和ej之间的连接谓词。
- 根据权利要求15所述的装置,其特征在于,所述确定模块具体用于:对于所述原始查询计划中的每个连接操作节点oB,遍历以oB为根节点的子树中的每一个连接操作节点oA,oA在以oB为根节点的子树的左子树中时,若oA和oB不满足操作级别的结合规则和谓词级别的结合规则,则为oB上的重组后的每个连接谓词添加第一约束条件,若oA和oB不满足操作级别的左置换规则和谓词级别的左置换规则,则为oB上的重组后的每个连接谓词添加第二约束条件;oA在以oB为根节点的子树的右子树中时,若oA和oB不满足操作级别的结合规则和谓词级别的结合规则,则为oB上的重组后的每个连接谓词添加第二约束条件,若oA和oB不满足操作级别的右置换规则和谓词级别的右置换规则,则为oB上的重组后的每个连接谓词添加第一约束条件;所述第一约束条件为T(e2)->T(e1)∩T(pa1∧pa2∧…∧pan),所述第二约束条件为T(e1)->T(e2)∩T(pa1∧pa2∧…∧pan),T(e1)表示以oA为根节点的子树的左子树e1包括的原始输入表,T(e2)表示以oA为根节点的子树的右子树e2包括的原始输入表,T(pa1∧pa2∧…∧pan)表示oA上的重组后的连接谓词pa1∧pa2∧…∧pan中包括的原始输入表,T1->T2表示若以T1->T2所约束的连接谓词所在的连接操作为根节点的第一子树包括T1中的任意一个输入表,则所述第一子树包括T2中的所有输入表。
- 根据权利要求10至16中任一项所述的装置,其特征在于,所述确定模块具体用于:若第一候选查询计划P’满足以下条件,则确定P’为所述原始查询计划P的等价查询计划:P’的每个第一连接操作的连接类型是内连接,所述第一连接操作为具有 两个以上重组后的连接谓词的连接操作,且所述两个以上重组后的连接谓词中的每个连接谓词在P中所对应的连接操作的连接类型是内连接;对于P’中每个连接操作ob’上的每个连接谓词p,在ob’不满足操作级别的交换规则时,P’中的Tl(p)和P中的Tl(p)相等且P’中的Tr(p)和P中的Tr(p)相等,其中,Tl(p)表示p所在连接操作的左子树中包括的p的输入表,Tr(p)表示p所在连接操作的右子树中包括的p的输入表,在ob’满足操作级别的交换规则时,P’中的Tl(p)和P中的Tl(p)相等且P’中Tr(p)和P中的Tr(p)相等,或者P’中的Tl(p)和P中的Tr(p)相等且P’中的Tr(p)和P中的Tl(p)相等;对于P’中每个连接操作ob’上的每个连接谓词p,p满足p在P中的约束条件。
- 根据权利要求11所述的装置,其特征在于,所述查询模块具体用于:从所述等价查询计划集合中选择代价最小的查询计划进行查询。
- 一种数据查询的装置,其特征在于,所述装置包括处理器和存储器,其中,所述存储器用于存储指令,所述处理器用于执行所述指令,所述指令在被所述处理器执行时,使所述处理器执行根据权利要求1至9中任一项所述的方法。
- 一种数据库系统,其特征在于,包括根据权利要求10至18中任一项所述的数据查询的装置和数据库。
Priority Applications (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2015/095909 WO2017091925A1 (zh) | 2015-11-30 | 2015-11-30 | 数据查询的方法、装置和数据库系统 |
BR112018010857-0A BR112018010857B1 (pt) | 2015-11-30 | 2015-11-30 | Método e aparelho de consulta de dados, e sistema de banco de dados |
EP15909443.2A EP3373154A4 (en) | 2015-11-30 | 2015-11-30 | Data query method and apparatus, and database system |
JP2018527925A JP6628455B2 (ja) | 2015-11-30 | 2015-11-30 | データ照会方法および装置ならびにデータベースシステム |
SG11201804544QA SG11201804544QA (en) | 2015-11-30 | 2015-11-30 | Data query method and apparatus, and database system |
KR1020187017354A KR102138627B1 (ko) | 2015-11-30 | 2015-11-30 | 데이터 쿼리 방법 및 장치, 및 데이터베이스 시스템 |
CN201580005935.1A CN107251013B (zh) | 2015-11-30 | 2015-11-30 | 数据查询的方法、装置和数据库系统 |
US15/992,925 US10885034B2 (en) | 2015-11-30 | 2018-05-30 | Data query method and apparatus, and database system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2015/095909 WO2017091925A1 (zh) | 2015-11-30 | 2015-11-30 | 数据查询的方法、装置和数据库系统 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/992,925 Continuation US10885034B2 (en) | 2015-11-30 | 2018-05-30 | Data query method and apparatus, and database system |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2017091925A1 true WO2017091925A1 (zh) | 2017-06-08 |
Family
ID=58796008
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2015/095909 WO2017091925A1 (zh) | 2015-11-30 | 2015-11-30 | 数据查询的方法、装置和数据库系统 |
Country Status (8)
Country | Link |
---|---|
US (1) | US10885034B2 (zh) |
EP (1) | EP3373154A4 (zh) |
JP (1) | JP6628455B2 (zh) |
KR (1) | KR102138627B1 (zh) |
CN (1) | CN107251013B (zh) |
BR (1) | BR112018010857B1 (zh) |
SG (1) | SG11201804544QA (zh) |
WO (1) | WO2017091925A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111104426A (zh) * | 2019-11-22 | 2020-05-05 | 深圳智链物联科技有限公司 | 一种数据查询方法及系统 |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP6707797B2 (ja) * | 2017-03-29 | 2020-06-10 | 株式会社日立製作所 | データベース管理システム及びデータベース管理方法 |
CN108664516A (zh) * | 2017-03-31 | 2018-10-16 | 华为技术有限公司 | 查询优化方法及相关装置 |
US10885035B2 (en) * | 2019-04-26 | 2021-01-05 | Advanced New Technologies Co., Ltd. | Method and system for outer join of database tables |
CN111949686B (zh) * | 2019-05-14 | 2024-05-14 | 阿里巴巴集团控股有限公司 | 一种数据处理方法、装置及设备 |
US20200409948A1 (en) * | 2019-06-26 | 2020-12-31 | International Business Machines Corporation | Adaptive Query Optimization Using Machine Learning |
CN111151858B (zh) * | 2020-01-13 | 2021-10-15 | 吉利汽车研究院(宁波)有限公司 | 一种点焊焊接参数应用系统及设置方法 |
KR102125010B1 (ko) * | 2020-03-17 | 2020-06-19 | 김명훈 | 데이터베이스 전환 분석 시스템 및 방법 |
CN114168620B (zh) * | 2022-02-11 | 2022-05-17 | 北京奥星贝斯科技有限公司 | 执行计划的处理方法及装置 |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080133461A1 (en) * | 2006-11-30 | 2008-06-05 | Ianywhere Solutions, Inc. | Optimization of left and right outer join operations in database management systems |
CN103678589A (zh) * | 2013-12-12 | 2014-03-26 | 用友软件股份有限公司 | 一种基于等价类的数据库内核查询优化方法 |
CN103714058A (zh) * | 2012-09-28 | 2014-04-09 | Sap股份公司 | 数据库查询的优化 |
CN104216891A (zh) * | 2013-05-30 | 2014-12-17 | 国际商业机器公司 | 关系型数据库中的查询语句的优化方法和设备 |
CN104285222A (zh) * | 2012-05-07 | 2015-01-14 | 国际商业机器公司 | 使用谓词映射器优化查询 |
US20150324383A1 (en) * | 2014-05-06 | 2015-11-12 | International Business Machines Corporation | Optimizing relational database queries with multi-table predicate expressions |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5819255A (en) | 1996-08-23 | 1998-10-06 | Tandem Computers, Inc. | System and method for database query optimization |
JP4552242B2 (ja) * | 1999-10-06 | 2010-09-29 | 株式会社日立製作所 | 仮想表インタフェースと該インタフェースを用いた問合せ処理システム及び方法 |
JP3515050B2 (ja) * | 2000-07-07 | 2004-04-05 | 三菱電機株式会社 | データベース演算処理装置 |
US6665663B2 (en) | 2001-03-15 | 2003-12-16 | International Business Machines Corporation | Outerjoin and antijoin reordering using extended eligibility lists |
US6598044B1 (en) * | 2002-06-25 | 2003-07-22 | Microsoft Corporation | Method for choosing optimal query execution plan for multiple defined equivalent query expressions |
US7617179B2 (en) * | 2002-06-29 | 2009-11-10 | Ianywhere Solutions, Inc. | System and methodology for cost-based subquery optimization using a left-deep tree join enumeration algorithm |
US8086598B1 (en) * | 2006-08-02 | 2011-12-27 | Hewlett-Packard Development Company, L.P. | Query optimizer with schema conversion |
CN101339551B (zh) | 2007-07-05 | 2013-01-30 | 日电(中国)有限公司 | 自然语言查询需求扩展设备及其方法 |
US8224806B2 (en) | 2009-07-31 | 2012-07-17 | Hewlett-Packard Development Company, L.P. | Selectivity-based optimized-query-plan caching |
US8589382B2 (en) * | 2011-12-29 | 2013-11-19 | International Business Machines Corporation | Multi-fact query processing in data processing system |
US10133778B2 (en) * | 2015-11-20 | 2018-11-20 | Sap Se | Query optimization using join cardinality |
-
2015
- 2015-11-30 BR BR112018010857-0A patent/BR112018010857B1/pt active IP Right Grant
- 2015-11-30 WO PCT/CN2015/095909 patent/WO2017091925A1/zh active Application Filing
- 2015-11-30 EP EP15909443.2A patent/EP3373154A4/en not_active Ceased
- 2015-11-30 KR KR1020187017354A patent/KR102138627B1/ko active IP Right Grant
- 2015-11-30 SG SG11201804544QA patent/SG11201804544QA/en unknown
- 2015-11-30 CN CN201580005935.1A patent/CN107251013B/zh active Active
- 2015-11-30 JP JP2018527925A patent/JP6628455B2/ja active Active
-
2018
- 2018-05-30 US US15/992,925 patent/US10885034B2/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080133461A1 (en) * | 2006-11-30 | 2008-06-05 | Ianywhere Solutions, Inc. | Optimization of left and right outer join operations in database management systems |
CN104285222A (zh) * | 2012-05-07 | 2015-01-14 | 国际商业机器公司 | 使用谓词映射器优化查询 |
CN103714058A (zh) * | 2012-09-28 | 2014-04-09 | Sap股份公司 | 数据库查询的优化 |
CN104216891A (zh) * | 2013-05-30 | 2014-12-17 | 国际商业机器公司 | 关系型数据库中的查询语句的优化方法和设备 |
CN103678589A (zh) * | 2013-12-12 | 2014-03-26 | 用友软件股份有限公司 | 一种基于等价类的数据库内核查询优化方法 |
US20150324383A1 (en) * | 2014-05-06 | 2015-11-12 | International Business Machines Corporation | Optimizing relational database queries with multi-table predicate expressions |
Non-Patent Citations (1)
Title |
---|
See also references of EP3373154A4 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111104426A (zh) * | 2019-11-22 | 2020-05-05 | 深圳智链物联科技有限公司 | 一种数据查询方法及系统 |
CN111104426B (zh) * | 2019-11-22 | 2024-04-05 | 深圳智链物联科技有限公司 | 一种数据查询方法及系统 |
CN111104426B8 (zh) * | 2019-11-22 | 2024-04-23 | 北京傲速科技有限公司 | 一种数据查询方法及系统 |
Also Published As
Publication number | Publication date |
---|---|
CN107251013B (zh) | 2020-02-14 |
EP3373154A1 (en) | 2018-09-12 |
BR112018010857B1 (pt) | 2023-02-07 |
US20180276277A1 (en) | 2018-09-27 |
JP2019504390A (ja) | 2019-02-14 |
SG11201804544QA (en) | 2018-06-28 |
BR112018010857A2 (zh) | 2018-11-21 |
BR112018010857A8 (pt) | 2022-11-29 |
JP6628455B2 (ja) | 2020-01-08 |
KR102138627B1 (ko) | 2020-07-28 |
KR20180083927A (ko) | 2018-07-23 |
CN107251013A (zh) | 2017-10-13 |
EP3373154A4 (en) | 2018-09-12 |
US10885034B2 (en) | 2021-01-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2017091925A1 (zh) | 数据查询的方法、装置和数据库系统 | |
CN106227800B (zh) | 一种高度关联大数据的存储方法及管理系统 | |
US11068439B2 (en) | Unsupervised method for enriching RDF data sources from denormalized data | |
Simitsis et al. | Optimizing ETL processes in data warehouses | |
US9514188B2 (en) | Integrating map-reduce into a distributed relational database | |
US8943059B2 (en) | Systems and methods for merging source records in accordance with survivorship rules | |
US9317544B2 (en) | Integrated fuzzy joins in database management systems | |
US20150278268A1 (en) | Data encoding and corresponding data structure | |
US20130346429A1 (en) | Systems and Methods for Analyzing Existing Data Models | |
US8244760B2 (en) | Segmentation and profiling of users | |
US10831737B2 (en) | Method and device for partitioning association table in distributed database | |
US7539663B2 (en) | Mapping composition using algebraic operators | |
CN110019314B (zh) | 基于数据项分析的动态数据封装方法、客户端和服务端 | |
CN108431766B (zh) | 用于访问数据库的方法和系统 | |
US20210019317A1 (en) | Predictive query improvement | |
US9619458B2 (en) | System and method for phrase matching with arbitrary text | |
US8150855B2 (en) | Performing an efficient implicit join of multiple mixed-type records | |
JP5981382B2 (ja) | 部分木併合装置、部分木併合方法および部分木併合プログラム | |
US11138174B2 (en) | Electronic database and method for forming same | |
DeBrie | The dynamodb book | |
Simitsis et al. | Logical optimization of ETL workflows | |
US11803545B1 (en) | Runtime statistics feedback for query plan cost estimation | |
US11822531B2 (en) | Method and system for using auxiliary tables for RDF data stored in a relational database | |
Pandit et al. | Accelerating big data analytics with collaborative planning in Teradata Aster 6 | |
KR101757251B1 (ko) | 집계질의를 처리하기 위한 장치 및 그 방법 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15909443 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2018527925 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 11201804544Q Country of ref document: SG |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112018010857 Country of ref document: BR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2015909443 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 20187017354 Country of ref document: KR Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020187017354 Country of ref document: KR |
|
ENP | Entry into the national phase |
Ref document number: 112018010857 Country of ref document: BR Kind code of ref document: A2 Effective date: 20180528 |