Patents by Inventor Vishnukumar T. Santharam

Vishnukumar T. Santharam 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: 10318551
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Grant
    Filed: May 18, 2016
    Date of Patent: June 11, 2019
    Assignee: International Business Machines Corporation
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T Santharam
  • Patent number: 9619549
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Grant
    Filed: May 16, 2016
    Date of Patent: April 11, 2017
    Assignee: International Business Machines Corporation
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T Santharam
  • Publication number: 20160259838
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Application
    Filed: May 16, 2016
    Publication date: September 8, 2016
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T Santharam
  • Publication number: 20160259839
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Application
    Filed: May 18, 2016
    Publication date: September 8, 2016
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T Santharam
  • Patent number: 9396246
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Grant
    Filed: November 8, 2013
    Date of Patent: July 19, 2016
    Assignee: International Business Machines Corporation
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T Santharam
  • Patent number: 9384256
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Grant
    Filed: September 5, 2014
    Date of Patent: July 5, 2016
    Assignee: International Business Machines Corporation
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T Santharam
  • Publication number: 20150134598
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Application
    Filed: November 8, 2013
    Publication date: May 14, 2015
    Applicant: International Business Machines Corporation
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T. Santharam
  • Publication number: 20150134599
    Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
    Type: Application
    Filed: September 5, 2014
    Publication date: May 14, 2015
    Inventors: Biswadeep Banerjee, Michael L. Lamb, Mack E. Phelps, Vishnukumar T. Santharam