Sap Se

Sap Ag

Stefan A Baeuerle

Peter Eberlein

Uwe Schlarb

Daniel Hutzel

Timm Falter

Bernhard Thimmel

Mihnea Andrei

Matthias Lehr

Robert Getzner

Juchang Lee

Joo Yeon Lee

Ki Hong Kim

Marita Kruempelmann

Seyeong Bae

Ruediger Karl

Marek Kowalkiewicz

Ruopeng Lu

Frank Brunswig

Di Wu

Guenter Pecht-Seibert

Jan Teichmann

Daniel Figus

Christian Bensberg

Thomas Wieczorek

Daniel Niehoff

Mario Andy Mueller

Volker Driesen

Gerd Ritter

Anil Kumar Goel

Alexander Boehm

Juergen Specht

Thomas Fiedler

Daniel Zoch

Frank Renkes

Olaf Meincke

Taehyung Lee

Rene Dehn

Abhay A Tiple

Daniel Goldmann

Sonia Lippe

Jin Uk Bae

Udo Peter Klein

Volker Sauermann

Bare Said

Joachim Fitzer

Johannes Merx

Arne Harren

Michael Wintergerst

Steffen Geissinger

Simon Lueders

Martin Hartig

Alexander Bunte

Jonathan Bregler

Andreas Kellner

Wolfgang Lehner

Michael Schnaubelt

Daniel Kuntze

Ioannis Grammatikakis

Le-Huan Stefan Tran

Carsten Ziegler

Jens Freund

Sung Heun Wi

Meinolf Block

Frank Jentsch

Vladislav Leonkev

Markus Viol

Gregor Karl Frey

Jaeyun Noh

Baré Said

Thomas Gauweiler

Torsten Strahl

Frank Michael Kraft

Gunther Liebich

Reiner P Hammerich

Cornelia Kinder

Bjoern Mielenhausen

Steffen Tatzel

Ralph Debusmann

Wolfgang M Koch

Stefan Rossmanith

Adam Polly

Klaus Kopecz

Georg Wilhelm

Andreas Balzar

Torsten Ziegler

Peter Surma

Toralf Grossmann

Daniel Wachs

Anne Jacobi

Christopher Schildt

Jens Weiler

Frank-Martin Haas

Andreas Brossler

Stefan Adelmann

Michael Hartel

Marcel Kassner

Patrick Schmidt

Dirk A Giebel

Andreas Thumfart

Steffen Witt

Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.

Virtual database tables with updatable logical table pointers

Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in-memory storage or in dynamic storage of a database management system. The dynamic storage includes an in-memory buffer cache and persistent storage. The logical pointer can be updated to point to the in-memory storage or the dynamic storage, including based on use statistics. Similarly, a table having data for the virtual table can be transitioned between the in-memory buffer cache and the persistent storage, including based on use statistics for the virtual table. A value for the logical pointer can be updated when the table is transferred between the in-memory buffer cache and the dynamic storage.

Implementations of the present disclosure include receiving a query, the query including an expression macro (EM), processing the query to provide a raw parse tree, the raw parse tree including an initial node representative of the EM, retrieving metadata corresponding to the EM, the metadata including a definition string, replacing the initial node with a node based on the definition string to provide a consumable parse tree, and executing the query within the database system using the consumable parse tree to provide a query result.

Dynamic query expressions

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

A method, a system and a computer program product for executing management of ownership of data. An index in a plurality of indexes is selected. The index corresponds to a plurality of ranges of data values stored in a plurality of database slices of a database. The index further corresponds to a partitioning structure that includes a plurality of hierarchically arranged nodes. Each node corresponds to a range of data values stored in at least one database slice. The structure is replicated across a plurality of computing systems. A computing system executes an update to one or more ranges of data values. The system replicates at least one of a database slice including the updated ranges of data values and a node that includes the updated ranges of data values to another computing system for storage of a replicate of the updated ranges of data values.

Multi-master with ownership transfer

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

A system includes reception of a first query at a first host, determination, at the first host, that the first query is associated with a first table, the first table including geographically-restricted data and a partitioning column storing identifiers of geographic restrictions, determination, at the first host and based on the partitioning column of the first table and on the first query, a first partition of the first table and a storage location of the first partition, and execution of the first query at the first host in conjunction with the storage location of the first partition.

Platform-based data segregation

A system, medium, and method to define a database table and view based on a database model using a database language statement, the database language statement including a statement to create the table and a forward-declared JOIN statement that names the table and view, respectively and includes information regarding a relationship between at least two entities of the database.

Enhancements for forward joins expressing relationships

The present disclosure involves systems, software, and computer implemented methods for using declarative rules for optimized access to data. One example method includes receiving a structured query language (SQL) query, the SQL query associated with at least one database table and at least one predicate. A determination is made as to whether the SQL query is associated with at least one declarative rule based on the at least one database table and the at least one predicate. In response to determining that the SQL query is associated with at least one declarative rule, the at least one associated declarative rule is applied, during optimization of the SQL query. The at least one declarative rule defines a transformation to the SQL query to be performed during query optimization. An updated SQL query is generated based on the applied at least one associated declarative rule and the updated SQL query is provided.

Declarative rules for optimized access to data

A method for propagating a structure query language (SQL) association can include determining, based at least on a syntax of a SQL create view statement, that a SQL association requires propagation to a SQL view associated with the SQL create view statement. The SQL association can combine data from at least a first data model and a second data model at a database. The SQL view can comprise at least a portion of the combined data. An association information data structure can be generated for storing information corresponding to a definition of the SQL association. The SQL create view statement can be executed based on the association information data structure. Related systems and articles of manufacture, including computer program products, are also disclose.

Propagation of structured query language associations

A system, a method, and a computer program product for deployment of objects are disclosed. Using a deployment infrastructure of a database system, a deployment container for deployment of at least one object at runtime of an application is generated. The container includes at least one artifact for the object and a container schema indicative of at least one dependency associated with the object. At least one deployment privilege is associated based on the container schema with the artifact for the object. The artifact of the deployment container is deployed based on the associated deployment schema during runtime of the application. The container can be an isolated container and an access privilege to an object can be requested based on a synonym for deployment purposes.

Database level containers

A database language (e.g. SQL) is extended to define a transient field whose value is derived from data stored in a database. The value of the transient field is calculated by the database engine for consumption as needed by the application layer, for example as part of a particular data model. The value of the transient field may not be materialized as a persistent field in the underlying database table, or may be selectively materialized based upon a heuristic or hint. Certain embodiments may implement the transient field as a basic elaboration on standard SQL utilizing an identifier. Some embodiments may implement the transient field as an entity where SQL has been extended to accommodate concepts of a higher-level Entity Relationship Model (ERM). The use of constants and/or floating values (e.g. a current time) in connection with transient fields, is also disclosed.

SQL extended with transient fields for calculation expressions in enhanced data models

Growing community of inventors

Malsh, Germany

Stefan A Baeuerle