Sap Ag

Sap Se

Eric Peukert

Zbigniew Jerzak

Katja Pfeifer

Uwe Jugel

Katja Seidler

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. In many cases, the query rewriter significantly reduces the volume of query results while facilitating fast interaction with the visualization.

Pixel-aware query rewriting

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.

System and method of merging text analysis results

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.

Automatic combination and mapping of text-mining services

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.

Growing community of inventors

Dresden, Germany

Eric Peukert