Patents by Inventor Eric Peukert
Eric Peukert 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: 10261956Abstract: A query rewriter associated with a database management system or visualization client rewrites a database query based on properties, characteristics, etc. of the visualization to be rendered by the visualization client. For example, the query rewriter receives an initial query and one or more visualization parameters (such as width, height and/or type of visualization) for the visualization client. The query rewriter rewrites the initial query based on the visualization parameter(s), so as to produce a data-reducing query, and then outputs the data-reducing query for execution. The query rewriter can selectively rewrite the initial query depending on size of query results of the initial query. In some example implementations, the query rewriting models a process of rasterization of geometric primitives by the visualization client, so as to facilitate error-free visualization.Type: GrantFiled: May 28, 2014Date of Patent: April 16, 2019Assignee: SAP SEInventors: Uwe Jugel, Zbigniew Jerzak, Eric Peukert
-
Publication number: 20150347528Abstract: A query rewriter associated with a database management system or visualization client rewrites a database query based on properties, characteristics, etc. of the visualization to be rendered by the visualization client. For example, the query rewriter receives an initial query and one or more visualization parameters (such as width, height and/or type of visualization) for the visualization client. The query rewriter rewrites the initial query based on the visualization parameter(s), so as to produce a data-reducing query, and then outputs the data-reducing query for execution. The query rewriter can selectively rewrite the initial query depending on size of query results of the initial query. In some example implementations, the query rewriting models a process of rasterization of geometric primitives by the visualization client, so as to facilitate error-free visualization.Type: ApplicationFiled: May 28, 2014Publication date: December 3, 2015Inventors: Uwe Jugel, Zbigniew Jerzak, Eric Peukert
-
Patent number: 9047347Abstract: A system and method of merging text analysis results. The system uses a set of three corrected, weakened Jaccard factors to determine whether the respective results of multiple text analysis operations are equal, subtypes of each other or associated with each other, in order to merge the results.Type: GrantFiled: June 10, 2013Date of Patent: June 2, 2015Assignee: SAP SEInventors: Katja Pfeifer, Eric Peukert
-
Publication number: 20140365525Abstract: A system and method of merging text analysis results. The system uses a set of three corrected, weakened Jaccard factors to determine whether the respective results of multiple text analysis operations are equal, subtypes of each other or associated with each other, in order to merge the results.Type: ApplicationFiled: June 10, 2013Publication date: December 11, 2014Inventors: Katja Pfeifer, Eric Peukert
-
Patent number: 8880440Abstract: Embodiments of systems and methods for automatic combination of text mining services, may comprise an instance generation component and an auto-mapping component. From common text sources, the instance generation component generates instances for taxonomy elements attached to a particular text mining service. These instances are then forwarded to the auto-mapping component, which computes a mapping between different taxonomies. This mapping may be saved to avoid repeated instance generation and mapping processes for similar taxonomies. The computed mapping may in turn be input to a result combiner element, together with extraction results from calling the different text mining services. The result combiner returns the merged result sets to the execution, and finally to the user or API.Type: GrantFiled: March 9, 2012Date of Patent: November 4, 2014Assignee: SAP AGInventors: Katja Seidler, Eric Peukert
-
Patent number: 8694561Abstract: In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph.Type: GrantFiled: June 7, 2012Date of Patent: April 8, 2014Assignee: SAP AGInventor: Eric Peukert
-
Publication number: 20130238531Abstract: Embodiments of systems and methods for automatic combination of text mining services, may comprise an instance generation component and an auto-mapping component. From common text sources, the instance generation component generates instances for taxonomy elements attached to a particular text mining service. These instances are then forwarded to the auto-mapping component, which computes a mapping between different taxonomies. This mapping may be saved to avoid repeated instance generation and mapping processes for similar taxonomies. The computed mapping may in turn be input to a result combiner element, together with extraction results from calling the different text mining services. The result combiner returns the merged result sets to the execution, and finally to the user or API.Type: ApplicationFiled: March 9, 2012Publication date: September 12, 2013Applicant: SAP AGInventors: Katja Seidler, Eric Peukert
-
Publication number: 20120259896Abstract: In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph.Type: ApplicationFiled: June 7, 2012Publication date: October 11, 2012Applicant: SAP AGInventor: Eric Peukert
-
Patent number: 8219596Abstract: In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph.Type: GrantFiled: March 8, 2010Date of Patent: July 10, 2012Assignee: Sap AGInventor: Eric Peukert
-
Publication number: 20110219044Abstract: In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph.Type: ApplicationFiled: March 8, 2010Publication date: September 8, 2011Applicant: SAP AGInventor: Eric Peukert
-
Publication number: 20110131253Abstract: In one embodiment the present invention includes computer-implemented method of performing schema matching. The method includes storing, by a computer system, a schema mapping that includes nodes. The schema mapping indicates a relationship between a first schema and a second schema. The method includes displaying, at a first node of the plurality of nodes, a graphical indication of the schema mapping at the first node. The method includes receiving, by the computer system, an evaluation of the schema mapping at the first node according to a user evaluating the graphical indication. The method includes adjusting the schema mapping as a result of the user evaluating the graphical indication. The method includes stepping, by the computer system, to a second node of the plurality of nodes. The method includes further displaying, receiving and adjusting the schema mapping as related to the second node.Type: ApplicationFiled: November 30, 2009Publication date: June 2, 2011Applicant: SAP AGInventors: Eric Peukert, Henrike Berthold, Julian Eberius
-
Publication number: 20100262836Abstract: Described herein are systems and methods for importing and retrieving schema mappings while preserving privacy and confidentiality so that existing mappings can be reused across different customers without allowing reverse engineering of the original schemas. The disclosed embodiments provide different levels of mapping anonymity and correspondingly, available structural information in the retrieved mappings, in accordance with the security and privacy requirements.Type: ApplicationFiled: April 13, 2009Publication date: October 14, 2010Inventors: ERIC PEUKERT, Ulrich Flegel, Gregor Hackenbroich, Philip Miseldine