Sap Se

Young Goo Cho

Jaehyok Chong

Ki Hong Kim

Techniques and solutions are provided for improved query optimization, including for sub-portions of a query plan. A query is submitted to an inline query optimizer and at least one auxiliary query optimizer. The query is optimized by the inline query optimizer and the auxiliary query optimizer. A query processor can evaluate costs associated with query plans produced by the inline query optimizer and the auxiliary query optimizer and select a plan for execution that is most performant.

Auxiliary query optimizer providing improved query performance

A computer implemented method can receive a first data table having a first column and a second data table having a second column, and obtain a dictionary shared by the first and second columns. The dictionary maps a plurality of unique data values to corresponding unique value identifiers. The method can generate a first data vector for the first column and a second data vector for the second column. The first data vector includes first value identifiers corresponding to data values stored in the first column, and the second data vector includes second value identifiers corresponding to data values stored in the second column. The method can join the first and second data tables based on the first and second data vectors. The joining generates one or more matching records between the first and second data tables. Related systems and software for implementing the method are also disclosed.

Dictionary sharing for efficient join operation in column store

A computer implemented method can execute a first query plan for a query, obtain statistics for internal nodes of a first query tree representing the first query plan, receive a second query tree representing a second query plan for the query, search for a matching internal node of the first query tree for a selected internal node of the second query tree, and responsive to finding the matching internal node of the first query tree, apply the statistics for the matching internal node of the first query tree to the selected internal node of the second query tree for estimating cost of the second query plan during query optimization of the query. Related systems and software for implementing the method are also disclosed.

Runtime statistics feedback for query plan cost estimation

The present disclosure provides techniques and solutions for improved query optimization. A query plan is received, and at least a portion of the query plan is identified to be analyzed for logically equivalent query plans. A signature is generated for the at least a portion of the query plan. One or more query plans are identified that have signature that matches the signature of the at least a portion of the query plan, but where such query plans are logically equivalent, but not identical, to the at least a portion of the query plan. A query plan of the one or more query plans is substituted in the query plan for the at least a portion of the query plan.

Growing community of inventors

Seoul, South Korea

Young Goo Cho