Patents by Inventor Frederik F. Flöther

Frederik F. Flöther 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).

  • Managing a distributed knowledge graph
    Patent number: 11294958
    Abstract: A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
    Type: Grant
    Filed: February 28, 2020
    Date of Patent: April 5, 2022
    Assignee: Kyndryl, Inc.
    Inventors: Tim U. Scheideler, Erik Rueger, Frederik F. Flöther, Stefan Ravizza
  • MANAGING A DISTRIBUTED KNOWLEDGE GRAPH
    Publication number: 20200201911
    Abstract: A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
    Type: Application
    Filed: February 28, 2020
    Publication date: June 25, 2020
    Inventors: Tim U. Scheideler, Erik Rueger, Frederik F. Flöther, Stefan Ravizza
  • Managing a distributed knowledge graph
    Patent number: 10678857
    Abstract: A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
    Type: Grant
    Filed: March 23, 2018
    Date of Patent: June 9, 2020
    Assignee: International Business Machines Corporation
    Inventors: Tim U. Scheideler, Erik Rueger, Frederik F. Flöther, Stefan Ravizza
  • MANAGING A DISTRIBUTED KNOWLEDGE GRAPH
    Publication number: 20190294733
    Abstract: A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
    Type: Application
    Filed: March 23, 2018
    Publication date: September 26, 2019
    Inventors: Tim U. Scheideler, Erik Rueger, Frederik F. Flöther, Stefan Ravizza