Invention Grant
- Patent Title: Logical, recursive definition of data transformations
-
Application No.: US17387217Application Date: 2021-07-28
-
Publication No.: US11526656B2Publication Date: 2022-12-13
- Inventor: Jan Portisch , Joachim Gross , Sandra Bracholdt
- Applicant: SAP SE
- Applicant Address: DE Walldorf
- Assignee: SAP SE
- Current Assignee: SAP SE
- Current Assignee Address: DE Walldorf
- Agency: Klarquist Sparkman, LLP
- Main IPC: G06F40/151
- IPC: G06F40/151 ; G06F16/2458 ; G06F40/103

Abstract:
Techniques and solutions are described for defining transformation specifications in a programming-language independent language and converting such specifications to one or more executable formats. The language can provide for defining rules and actions. Rules can refer to (e.g., be based at least in part on) data targets, such as attributes of a schema, whose identifiers are to be read or updated, or to other rules. Rules can be reused, and can recursively refer to one another, such that a large number of complex schema transformations can be accomplished using a series of first order logic statements. Actions can define what, and how, values will be changed when a predicate rule is satisfied. A transformation specification in the language can be parsed and selectively complied to one or more executable formats, including in programming languages such as the structured query language. Disclosed technologies can facilitate data transformations by non-technical users.
Public/Granted literature
- US20210357577A1 LOGICAL, RECURSIVE DEFINITION OF DATA TRANSFORMATIONS Public/Granted day:2021-11-18
Information query