Sap Se

Other

Taehyung Lee

Sung Heun Wi

Ki Hong Kim

Jin Uk Bae

Chuho Chang

Taehun Kim

Juchang Lee

Stefan A Baeuerle

Wolfgang Stephan

Yongsik Yoon

Myunggon Park

Nosub Sung

Sang Il Song

Felix Knittel

Taeyoung Jeong

Junhee Woo

Christian Bensberg

Di Wu

Johannes Merx

Sanghee Lee

Joo Yeon Lee

Steffen Geissinger

Sungwon Kim

Joo Young Yoon

Chul Won Lee

Jaeyun Noh

Yinghua Ouyang

Hyeong Seog Kim

Zhen Tian

Eunsang Kim

Jane Jung Lee

Kai Morich

Donghyun Park

Thomas Seufert

Hong-Hai Do

Stephan Kessler

Kyungyul Park

Jaehwa Kim

Long Zhang

Juhyeon Jeong

Xun Zhang

Yanchen Cao

Florian Scheid

Jens Hoff

Jiyoung Yoo

Daniel Wontae Choi

Hanghun Choi

Chui Won Lee

Dongmei Xv

Kaweh Amoi-Taleghani

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

Various systems and methods for selective revalidation of data objects are provided. In one example, a computer-implemented method includes updating a target data object of a database system according to a definition statement, and determining whether the definition statement changes one or more object properties of the target data object. In response to determining that the definition statement changes the one or more object properties of the target data object, the method includes revalidating data objects depending on the target data object. In response to determining that the definition statement does not change the one or more object properties of the target data object, the method includes not revalidating the data objects depending on the target data object. In this way, database management performance and speed may be improved while maintaining validity of data objects in a database.

Fine-grained decision on propagation of revalidation

Techniques and solutions are provided for providing federated data access to parameterized data objects. At a local system, a virtual parameterized data object is created. A remote computing system is contacted to obtain parameters used by a parameterized data object of the remote computing system to which the virtual parameterized data object corresponds. Parameter information received from the remote system is stored in a definition of the virtual parameterized data object at the local system. When a request for a database operation involving the virtual parameterized data object is received, the parameter information can be used to determine whether the request is correctly formed, or can be used in preparing a request to be sent to the remote system to be performed using the parameterized data object to obtain information specified in the request for a database operation.

Virtual access to parameterized data objects

Disclosed herein are system, method, and computer tangible medium embodiments for generating a relational database model from a model view that provides an estimate for generating query plan for a query on the model view, according to an embodiment. A join model of a model view set on one or more database tables is received. At least one index conversion of the join model is performed, where the index conversion converts at least one index in the join model into at least one leaf node in a relational model tree. At least one join conversion of the join model is performed where the at least one join conversion generates a node in the relational model tree that joins a first and second leaf nodes in the relational model tree. A requested parameter conversion is performed, where the requested parameter conversion includes an attribute or key figure requested by a query.

Conversion of model views into relational models

A process is provided for independently hashing and filtering a data set, such as during preprocessing. For the data set, one or more records, separately having one or more fields, may be identified. A record hash value set, containing one or more record hash values for the respective one or more records, may be generated. Generating a given record hash value may be accomplished as follows. For a given record, a hash value set may be generated, having one or more field hash values for the respective one or more fields of the given record. The record hash value for the given record may be generated based on the hash value set. A total hash value for the data set may be generated based on the record hash value set. The records of the data set may be filtered based on classification of the query that generated the records.

Order-independent multi-record hash generation and data filtering

Implementations of the present disclosure include receiving a view command for creating a view to display anonymized data in response to one or more queries, the view command including a view name, a table, a set of columns of the table, an anonymization type, a set of static parameters, and, for a sub-set of columns of the table, one or more sets of column-specific parameters, each set of column-specific parameters being specific to anonymization of data of a respective column of the table included in the sub-set of columns, storing the view command within the database system, and receiving a query referencing the view, and in response, providing a data set including data from each column in the sub-set of columns, receiving an anonymized data set including anonymized data that is generated from the data set using the anonymization type, the static parameters, and the sets of column-specific parameters.

Data anonymization in database management systems

Implementations of the present disclosure include receiving, by a query processing server, a first query, the first query including a syntax indicating that precision loss is allowed, processing, by the query processing server, the first query to provide a first QEP, optimization of which would result in precision loss in a generated query result, determining that the syntax is provided, and in response, optimizing the first QEP to provide an optimized QEP, executing the optimized QEP to generate a query result that includes data stored within a database system, the query result having reduced accuracy relative to a query result that would be generated based on the first QEP, and providing the query result as output from the database system.

Selectively allowing query optimization in query processing

Methods and apparatus, including computer program products, are provided for a case join. In one aspect, there is provided method, which may include receiving a query for a predefined view that is configured to inhibit modification; detecting whether the predefined view includes a database table extended to include an additional column; and generating, in response to the query, a view based on a case join, when the predefined view includes the database table extended to include the additional column. Related apparatus, systems, methods, and articles are also described.

Case join decompositions

A method can include: generating a query execution plan for a query including a plurality of operations that operate on data from a relational database and data from a non-structured query language (NoSQL) database, the generating comprising optimizing the query by: identifying a first operation that operate on data from the relational database and an intermediate result output by a second operation, the second operation outputting the intermediate result by operating on the data from the NoSQL database; and determining a fixed datatype for the intermediate result, an indication of the fixed datatype being included in the query execution plan; and executing, based on the query execution plan, the query, the executing of the query comprising converting the intermediate result to the fixed datatype, the converting enabling the first operation to operate on the intermediate result output by the second operation along with the data from the relational database.

Harmonized structured query language and non-structured query language query processing

In one aspect there is a method. The method may include associating a query received from an application with a hint, wherein the hint modifies an execution of the query. The method may further include an optimizer to compile the query according to the hint to produce a second query plan. When no hint is associated with the query, the optimizer may produce a first query plan. The method may further include storing the hint in a persistent table to enable state preservation during a database restart or binary upgrade, and/or executing the query using the second query plan.

Query plan optimization by persisting a hint table

Disclosed herein are system, method, and computer program product embodiments for utilizing join cardinality to improve the performance of query processing. An embodiment operates by a database engine receiving a query including a join operation on a first and a second table using a join predicate, and a tag for the join operation indicating a cardinality relationship between the first and the second table when satisfying the join predicate. Then, the database engine generates a query processing plan for performing the query. For the join operation, the database engine selects one of the first or the second tables to remove from the join operation based on a type of the join operation and the tag. Based on the selecting, the database engine may remove may the join operation and the selected table from the query processing plan.

Query optimization using join cardinality

An electrically motorized driving wheel for vehicles such as bicycles is provided. The electrically motorized wheel can include a wheel rim, a housing disposed inside and connected to the wheel rim, wherein the housing defines an installation space inside the housing, a driving force generating mechanism disposed in the installation space, and a driving force transfer mechanism connected to the driving force generating mechanism and configured to transfer a driving force generated from the driving force generating mechanism to the housing.

Driving wheel for vehicles

Growing community of inventors

Seoul, South Korea

Taehyung Lee