Patents by Inventor Karl Fuerst

Karl Fuerst 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).

  • Patent number: 7624117
    Abstract: Systems and techniques for the creation and use of a complex data structure identifier thesaurus. In one aspect, an article comprises one or more machine-readable media storing instructions operable to cause one or more machines to perform operations. The operations include receiving, from a data processing system, a collection of mapping information identifying a first object and a first collection of two or more keys used to identify the first object, determining whether a first key in the first collection is found in a first mapping group of a mapping data store, determining whether second key in the first collection is found in a second mapping group of the mapping data store, and merging the first mapping group and the second mapping group to reflect that objects from the first mapping group and the second mapping group are related.
    Type: Grant
    Filed: June 12, 2006
    Date of Patent: November 24, 2009
    Assignee: SAP AG
    Inventors: Karl Fuerst, Florian Kresser
  • Publication number: 20090063490
    Abstract: Methods and apparatus, including computer program products, for authorization controlled searching. In general, a search request is received, a database data structure is searched where the data structure is populated with records that include data and criteria for authorization to access the data, and a set of results is presented to a user, where the set of results includes data from the data structure for which a user is authorized the criteria is used to determine which results to include in the set of results. The criteria for authorization to access the data may be simple or complex, and may be based on a formation of associations from multiple layers of associations.
    Type: Application
    Filed: August 27, 2007
    Publication date: March 5, 2009
    Inventors: Karl Fuerst, Juergen Hofmann, Ionut Istrate, Thomas Finke, Florian Kresser, Marieta Koch
  • Publication number: 20080148006
    Abstract: Systems and techniques for mapping compound keys. In one aspect, a method includes receiving a first compound key, mapping the first compound key to a first surrogate key, mapping the first surrogate key to a second surrogate key, mapping the second surrogate key to a second compound key, and making the second compound key available for data processing activities.
    Type: Application
    Filed: December 18, 2006
    Publication date: June 19, 2008
    Applicant: SAP AG
    Inventors: Karl Fuerst, Florian Kresser, Holger Gockel
  • Patent number: 7386578
    Abstract: In a method of sharing data between a central module and a client module, a plurality of duplicate first data objects and a second data object are stored on a first client module, where the second data object includes a first pointer pointing to one of the duplicate first data objects. A third data object and a fourth data object are stored on the central module, where the third data object corresponds to each of the first data objects, and where the fourth data object corresponds to the second data object and includes a second pointer pointing to the third data object. A first mapping is established between the first data objects and the third data object. A second mapping is established between the second data object and the fourth data object. A third mapping is established between the first pointer and the second pointer, and the first, second, and third mappings are stored.
    Type: Grant
    Filed: October 29, 2004
    Date of Patent: June 10, 2008
    Assignee: SAP AG
    Inventor: Karl Fuerst
  • Publication number: 20080016063
    Abstract: Performing a negative key mapping process includes determining whether objects contain substantially the same information, and storing a negative key mapping for the objects if the objects do not contain substantially the same information. In this context, the negative key mapping includes data indicating that the objects are different, at least in part.
    Type: Application
    Filed: July 13, 2006
    Publication date: January 17, 2008
    Inventors: Karl Fuerst, Florian Kresser
  • Publication number: 20070288425
    Abstract: Systems and techniques for the creation and use of a complex data structure identifier thesaurus. In one aspect, an article comprises one or more machine-readable media storing instructions operable to cause one or more machines to perform operations. The operations include receiving, from a data processing system, a collection of mapping information identifying a first object and a first collection of two or more keys used to identify the first object, determining whether a first key in the first collection is found in a first mapping group of a mapping data store, determining whether second key in the first collection is found in a second mapping group of the mapping data store, and merging the first mapping group and the second mapping group to reflect that objects from the first mapping group and the second mapping group are related.
    Type: Application
    Filed: June 12, 2006
    Publication date: December 13, 2007
    Inventors: Karl Fuerst, Florian Kresser
  • Publication number: 20070112752
    Abstract: Systems and techniques for characterizing a similarity between first and second data objects are described. A system includes a matching engine configured to receive first and second results provided by first and second attribute-matching strategies. The matching engine is further configured to scale the first result by a first weight factor that indicates a first level of quality of a first attribute value and to scale the second result by a second weight factor that indicates a second level of quality of a second attribute value. The matching engine is further configured to combine the first and second scaled results to produce an overall result characterizing the similarity between the first and second objects.
    Type: Application
    Filed: November 14, 2005
    Publication date: May 17, 2007
    Inventors: Wolfgang Kalthoff, Jens Staeck, Karl Fuerst, Volker Schott, Peter Lang, Manfred Walter
  • Publication number: 20060143603
    Abstract: Determining the association between data objects may be accomplished using any of a variety of systems and techniques. In particular implementations, a system and technique may have the ability to receive a group of data objects and execute a matching algorithm to determine duplicate data object propositions between the data objects. The system and technique also may have the ability determine whether a data object is a potential duplicate data object and, if a data object is a potential duplicate data object, determine whether the data object is a duplicate data object by examining duplicate data object propositions of a plurality of data objects that are associated with the data object through duplicate data object propositions.
    Type: Application
    Filed: December 28, 2004
    Publication date: June 29, 2006
    Inventors: Wolfgang Kalthoff, Jens Staeck, Karl Fuerst, Volker Schott, Peter Lang, Manfred Walter
  • Publication number: 20060101096
    Abstract: In a method of sharing data between a central module and a client module, a plurality of duplicate first data objects and a second data object are stored on a first client module, where the second data object includes a first pointer pointing to one of the duplicate first data objects. A third data object and a fourth data object are stored on the central module, where the third data object corresponds to each of the first data objects, and where the fourth data object corresponds to the second data object and includes a second pointer pointing to the third data object. A first mapping is established between the first data objects and the third data object. A second mapping is established between the second data object and the fourth data object. A third mapping is established between the first pointer and the second pointer, and the first, second, and third mappings are stored.
    Type: Application
    Filed: October 29, 2004
    Publication date: May 11, 2006
    Inventor: Karl Fuerst
  • Publication number: 20060064465
    Abstract: A method of sharing data includes storing a central data object in the central computer system, the data object including an attribute and a plurality of values for the attribute and creating a first mapping between the values of the attribute stored in the central data object and values of an attribute for a first client data object stored in a client computer system. The first mapping is stored, and the first mapping is used to selectively extract first data from the central data object for distribution to the first client data object. The extracted data is distributed from the central computer system to one or more client systems.
    Type: Application
    Filed: September 17, 2004
    Publication date: March 23, 2006
    Inventor: Karl Fuerst