Logical, recursive definition of data transformations

US11106861B2 · kind B2 · utility

Assignee

• SAP SE · DE

Inventors

• Jan Portisch · Bruchsal, DE
• Joachim Gross · Altrip, DE
• Sandra Bracholdt · Dielheim, DE

Key dates

• Filing date: Feb 1, 2019
• Grant date: Aug 31, 2021
• Expiry date: Apr 14, 2039

Classification

• Technology area (CPC G): Physics
• CPC primary: G06F40/103
• WIPO field: Computer technology
• WIPO sector: Electrical engineering

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.