Patents by Inventor Tibor DIGANA

Tibor DIGANA 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: 9092481
    Abstract: In certain example embodiments, a graph query retrieves data items from a data source by indicating a source node, a target node, and a plurality of edges between the source and target nodes. Each edge includes one or more relation conditions. Each relation condition defines a mapping between items of one of the source item types and items of one of the target item types. The edges are selected and traversed from the source node to the target node in accordance with the relation condition(s), producing an intermediate set of result items including items of the data source that belong to the at least one target item type and fulfill the corresponding relation condition(s). Items from the intermediate set of result items that do not fulfill the corresponding relation condition(s) are deleted as further traversals are made. The intermediate set ultimately is returned as the graph query result.
    Type: Grant
    Filed: February 12, 2013
    Date of Patent: July 28, 2015
    Assignee: SOFTWARE AG
    Inventor: Tibor Digana
  • Publication number: 20140136520
    Abstract: In certain example embodiments, a graph query retrieves data items from a data source by indicating a source node, a target node, and a plurality of edges between the source and target nodes. Each edge includes one or more relation conditions. Each relation condition defines a mapping between items of one of the source item types and items of one of the target item types. The edges are selected and traversed from the source node to the target node in accordance with the relation condition(s), producing an intermediate set of result items including items of the data source that belong to the at least one target item type and fulfill the corresponding relation condition(s). Items from the intermediate set of result items that do not fulfill the corresponding relation condition(s) are deleted as further traversals are made. The intermediate set ultimately is returned as the graph query result.
    Type: Application
    Filed: February 12, 2013
    Publication date: May 15, 2014
    Applicant: SOFTWARE AG
    Inventor: Tibor DIGANA