Patents by Inventor Markus Riepp

Markus Riepp has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20180268028
    Abstract: A denormalized table, referred to as a semantic cluster table, allows for improved database system performance. Rather than accessing multiple tables, database operations can access a single table, which can reduce the number and complexity of database operations. The semantic cluster table includes a semantic indicator field. Different values of the semantic indicator field can be associated with different semantic contexts, allowing data to be accessed at a coarse granularity. Each semantic context can also be associated with one or more attribute fields, which can be used to access data, including at different level of granularity than the semantic indicator field value alone. Each semantic context can also be associated with specific key figure fields, which can preserve the different semantic contexts of data in the semantic cluster table.
    Type: Application
    Filed: March 17, 2017
    Publication date: September 20, 2018
    Applicant: SAP SE
    Inventors: Holger Wuest, Markus Kahn, Lothar Muessler, Dirk Endesfelder, Markus Riepp
  • Patent number: 8301476
    Abstract: The invention provides methods and apparatus, including computer program products, for of determining a possible lot size of units with respect to a fixed date for a chain of at least two process steps, each process step requiring a respective assigned resource, and consuming a respective time per unit for being performed by the respective assigned resource, where the process steps are sequentially dependent on each other. This is achieved by the following: (a) determining, for each resource, a respective time interval of availability during which the respective resource is continuously available, each time interval being limited by the fixed date, (b) calculating, for each determined time interval of availability, a respective largest possible number of times the respective process step can be performed by the respective resource, and (c) selecting the lot size of units to the minimum of the largest possible numbers.
    Type: Grant
    Filed: December 5, 2005
    Date of Patent: October 30, 2012
    Assignee: SAP Aktiengeselleschaft
    Inventors: Heinrich Braun, Markus Riepp, Thomas Dehoust
  • Publication number: 20090019446
    Abstract: The invention provides methods and apparatus, including computer program products, for of determining a possible lot size of units with respect to a fixed date for a chain of at least two process steps, each process step requiring a respective assigned resource, and consuming a respective time per unit for being performed by the respective assigned resource, where the process steps are sequentially dependent on each other. This is achieved by the following: (a) determining, for each resource, a respective time interval of availability during which the respective resource is continuously available, each time interval being limited by the fixed date, (b) calculating, for each determined time interval of availability, a respective largest possible number of times the respective process step can be performed by the respective resource, and (c) selecting the lot size of units to the minimum of the largest possible numbers.
    Type: Application
    Filed: December 5, 2005
    Publication date: January 15, 2009
    Inventors: Heinrich Braun, Markus Riepp, Thomas Dehoust