Sap Se

Taeyoung Jeong

Taehyung Lee

Taehun Kim

Sanghee Lee

Sungwon Kim

Ki Hong Kim

Yinghua Ouyang

Zhen Tian

Hong-Hai Do

Xun Zhang

Yanchen Cao

Kisung Park

Young-Koo Lee

Dongmei Xv

Md Mostofa Kamal Rasel

In some embodiments, a method receives a statement graph for a procedure that is used to access data and determines a set of producer statements and a set of consumer statements in the statement graph. A producer statement produces a variable for a consumer statement, and the consumer statement consumes the variable from the producer statement. The method optimizes the statement graph to generate an optimized procedure by moving an operator from a consumer statement to a producer statement or by moving an operator from a producer statement to a consumer statement. The optimized procedure is output based on the optimized statement graph.

Operator movement optimization technique for procedures

A computer implemented method can receive a parameterized query written in a declarative language. The parameterized query comprises a parameter which can be assigned different values. The method can perform a first compilation session of the parameterized query in which the parameter has no assigned value. Performing the first compilation session can generate an intermediate representation of the parameterized query. The intermediate representation describes a relational algebra expression to implement the parameterized query. The method can perform a second compilation session of the parameterized query in which parameter has an assigned value. Performing the second compilation session reuses the intermediate representation of the parameterized query.

Intelligent optimization of parameterized queries

1. Implementations of the present disclosure include receiving, by a database system, a query from an entity, providing a parse tree based on the query, the parse tree including nodes representative of operations to be executed and data objects stored within the database system, generating a module tree based on the parse tree, the module tree including a set of modules provided in sequential order from a root module to a leaf module, and executing an authorization check using the module tree by, for each module, determining a set of data objects and, for each data object in the set of data objects, determining whether the entity is one or more of authorized access the data object and perform an operation on the data object.

Authorization checks and auditing for queries in database systems

Growing community of inventors

Seoul, South Korea

Taeyoung Jeong