Patents by Inventor Udayan Das

Udayan Das 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).

  • Automated creation of join graphs for unrelated data sets among relational databases
    Patent number: 9916350
    Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.
    Type: Grant
    Filed: November 28, 2016
    Date of Patent: March 13, 2018
    Inventors: Jonathan Young, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das
  • AUTOMATED CREATION OF JOIN GRAPHS FOR UNRELATED DATA SETS AMONG RELATIONAL DATABASES
    Publication number: 20170193045
    Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.
    Type: Application
    Filed: November 28, 2016
    Publication date: July 6, 2017
    Inventors: Jonathan Young, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das
  • Automated creation of join graphs for unrelated data sets among relational databases
    Patent number: 9507824
    Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.
    Type: Grant
    Filed: August 24, 2015
    Date of Patent: November 29, 2016
    Assignee: Attivio Inc.
    Inventors: Jonathan Young, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das
  • AUTOMATED CREATION OF JOIN GRAPHS FOR UNRELATED DATA SETS AMONG RELATIONAL DATABASES
    Publication number: 20160055205
    Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.
    Type: Application
    Filed: August 24, 2015
    Publication date: February 25, 2016
    Inventors: Young Jonathan, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das