公开(公告)号：US10324929B2

公开(公告)日：2019-06-18

申请号：US15339615

申请日：2016-10-31

Applicant: SAP SE

Inventor： Weimin Qi ,  Jaehyok Chong ,  Kihong Kim ,  Yu Wang ,  Di Wu

IPC: G06F17/30 ,  G06F16/2453 ,  G06F11/36 ,  G06F8/41

Abstract: A query is parsed and positions of symbols of the query are determined. A parse tree including the positions of the symbols is generated based on the parsed query. The parse tree is sent to a DBMS optimizer. The parse tree is transformed into an optimizer tree. The optimizer tree includes the positions of the symbols of the query.Based on the optimizer tree, a query execution plan is generated for the execution of the query. The positions of the symbols of the query is copied from the optimizer tree into the query execution plan. The query execution plan is sent to a query execution engine.The query is executed in accordance with the query execution plan. When a runtime error is detected, an exception message associated with the runtime error is displayed. The error message includes an error code and the positions of the symbols of the query.

公开(公告)号：US09069809B2

公开(公告)日：2015-06-30

申请号：US14083209

申请日：2013-11-18

Applicant: SAP SE

Inventor： Sang K. Cha ,  Kihong Kim ,  Keun-Joo Kwon

IPC: G06F17/30

CPC classification number: G06F17/30321 ,  G06F17/30327 ,  G06F17/30333 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99942

Abstract: The apparatuses and methods described herein may operate to identify, from an index structure stored in memory, a reference minimum bounding shape that encloses at least one minimum bounding shape. Each of the at least one minimum bounding shape may correspond to a data object associated with a leaf node of the index structure. Coordinates of a point of the at least one minimum bounding shape may be associated with a set of first values to produce a relative representation of the at least one minimum bounding shape. The set of first values may be calculated relative to coordinates of a reference point of the reference minimum bounding shape such that each of the set of first values comprises a first number of significant bits fewer than a second number of significant bits representing a second value associated with a corresponding one of absolute coordinates of the point.

Abstract translation: 本文描述的装置和方法可以操作以从存储在存储器中的索引结构中识别包围至少一个最小边界形状的参考最小边界形状。 所述至少一个最小边界形状中的每一个可对应于与所述索引结构的叶节点相关联的数据对象。 所述至少一个最小边界形状的点的坐标可以与一组第一值相关联，以产生所述至少一个最小边界形状的相对表示。 可以相对于参考最小限制形状的参考点的坐标来计算第一值集合，使得该组第一值中的每一个包括少于第二数量的有效位，第二数量的有效位少于表示相关联的第二值的第二数量的有效位 与点的绝对坐标相对应。

公开(公告)号：US20180121326A1

公开(公告)日：2018-05-03

申请号：US15339615

申请日：2016-10-31

Applicant: SAP SE

Inventor： Weimin Qi ,  Jaehyok Chong ,  Kihong Kim ,  Yu Wang ,  Di Wu

IPC: G06F11/36 ,  G06F17/30

CPC classification number: G06F17/30463 ,  G06F8/427 ,  G06F11/3628 ,  G06F11/3636 ,  G06F17/30474

Abstract: A query is parsed and positions of symbols of the query are determined. A parse tree including the positions of the symbols is generated based on the parsed query. The parse tree is sent to a DBMS optimizer. The parse tree is transformed into an optimizer tree. The optimizer tree includes the positions of the symbols of the query.Based on the optimizer tree, a query execution plan is generated for the execution of the query. The positions of the symbols of the query is copied from the optimizer tree into the query execution plan. The query execution plan is sent to a query execution engine.The query is executed in accordance with the query execution plan. When a runtime error is detected, an exception message associated with the runtime error is displayed. The error message includes an error code and the positions of the symbols of the query.