Patents by Inventor Krishnan Meiyyappan

Krishnan Meiyyappan 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).

  • Publication number: 20150356158
    Abstract: A storage system communicatively coupled to a DBMS performs storage-side scanning of data sources that are not stored in the native database storage format of the DBMS. Data sources for external tables are accessible in a storage system referred to herein as a distributed data access system, e.g. a Hadoop Distributed File System. To execute a query that references an external table, a DBMS first generates an execution plan. The distributed data access system supplies the DBMS with information that specifies each portion of the data source, and specifies which data node to use to access the portion. The DBMS sends a request for each portion to the respective data node, the request requesting that the data node generate rows from data in the portion. The request may specify scanning criteria, specifying one or more columns to project and/or filter on. The request may also specify code modules for the data node to execute to generate rows or records and columns.
    Type: Application
    Filed: June 8, 2015
    Publication date: December 10, 2015
    Inventors: Dmitry Mikhailovich Potapov, Krishnan Meiyyappan, Alexander Tsukerman, Kothanda Umamageswaran, Semen Ustimenko, Wei Zhang, Adrian Tsz Him Ng, Daniel McClary, Allen Brumm, James Stenoish, Robert K. Abbott
  • Publication number: 20150088880
    Abstract: Techniques are described herein for supporting multiple versions of a database server within a database machine comprising a separate database layer and storage layer. In an embodiment, the database layer includes compute nodes each hosting one or more instances of a database server. The storage layer includes storage nodes each hosting one or more instances of a storage server, also referred to herein as a “cell server.” In general, the database servers may receive data requests, such as SQL queries, from client applications and service the requests in coordination with the cell servers of the storage layer.
    Type: Application
    Filed: June 24, 2014
    Publication date: March 26, 2015
    Inventors: Umesh Panchaksharaiah, Krishnan Meiyyappan, Kothanda Umamageswaran, Alex Tsukerman, Semen Ustimenko, Adrian Ng, Devang Mundhra, Yinian Qi
  • Publication number: 20140324821
    Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.
    Type: Application
    Filed: April 9, 2014
    Publication date: October 30, 2014
    Applicant: Teradata Corporation
    Inventors: Krishnan Meiyyappan, Liuxi Yang, Jeremy Branscome, Michael Paul Corwin, Ravindran Krishnamurthy, Kapil Laxmikant Surlaker, James Shau, Joseph Irawan Chamdani
  • Patent number: 8862625
    Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.
    Type: Grant
    Filed: April 7, 2008
    Date of Patent: October 14, 2014
    Assignee: Teradata US, Inc.
    Inventors: Krishnan Meiyyappan, Liuxi Yang, Jeremy Branscome, Michael Corwin, Ravi Krishnamurthy, Kapil Surlaker, James Shau, Joseph I. Chamdani
  • Publication number: 20130268489
    Abstract: Embodiments of the present invention provide fine grain concurrency control for transactions in the presence of database updates. During operations, each transaction is assigned a snapshot version number or SVN. A SVN refers to a historical snapshot of the database that can be created periodically or on demand. Transactions are thus tied to a particular SVN, such as, when the transaction was created. Queries belonging to the transactions can access data that is consistent as of a point in time, for example, corresponding to the latest SVN when the transaction was created. At various times, data from the database stored in a memory can be updated using the snapshot data corresponding to a SVN. When a transaction is committed, a snapshot of the database with a new SVN is created based on the data modified by the transaction and the snapshot is synchronized to the memory.
    Type: Application
    Filed: June 3, 2013
    Publication date: October 10, 2013
    Inventors: Kapil Surlaker, Ravindran Krishnamurthy, Krishnan Meiyyappan, Alan Lee Beck, Hung Tran, Jeremy Branscome, Joseph Chamdani
  • Patent number: 8458129
    Abstract: Embodiments of the present invention provide fine grain concurrency control for transactions in the presence of database updates. During operations, each transaction is assigned a snapshot version number or SVN. A SVN refers to a historical snapshot of the database that can be created periodically or on demand. Transactions are thus tied to a particular SVN, such as, when the transaction was created. Queries belonging to the transactions can access data that is consistent as of a point in time, for example, corresponding to the latest SVN when the transaction was created. At various times, data from the database stored in a memory can be updated using the snapshot data corresponding to a SVN. When a transaction is committed, a snapshot of the database with a new SVN is created based on the data modified by the transaction and the snapshot is synchronized to the memory.
    Type: Grant
    Filed: June 23, 2008
    Date of Patent: June 4, 2013
    Assignee: Teradata US, Inc.
    Inventors: Kapil Surlaker, Ravi Krishnamurthy, Krishnan Meiyyappan, Alan Beck, Hung Tran, Jeremy Branscome, Joseph I. Chamdani
  • Patent number: 8196150
    Abstract: An approach for reducing transport of messages between nodes of a multi-node system is presented wherein a message queue is associated with a queue service, and based on which node the message queue resides, one of the nodes is registered as hosting the associated queue service. In response to a client attempting to connect and requesting a particular queue service, the client is caused to connect to the node on which the queue service resides.
    Type: Grant
    Filed: October 7, 2005
    Date of Patent: June 5, 2012
    Assignee: Oracle International Corporation
    Inventors: Alan Downing, Krishnan Meiyyappan, James Stamos, Ramkumar Venkatesan
  • Patent number: 8165988
    Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.
    Type: Grant
    Filed: January 4, 2011
    Date of Patent: April 24, 2012
    Assignee: Teradata US, Inc.
    Inventors: James Shau, Krishnan Meiyyappan, Hung Tran, Ravi Krishnamurthy, Kapil Surlaker, Jeremy Branscome, Joseph I. Chamdani
  • Publication number: 20110246432
    Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.
    Type: Application
    Filed: May 13, 2011
    Publication date: October 6, 2011
    Applicant: TERADATA US, INC.
    Inventors: Liuxi Yang, Kapil Surlaker, Ravi Krishnamurthy, Michael Corwin, Jeremy Branscome, Krishnan Meiyyappan, Joseph I. Chamdani
  • Patent number: 7966343
    Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.
    Type: Grant
    Filed: April 7, 2008
    Date of Patent: June 21, 2011
    Assignee: Teradata US, Inc.
    Inventors: Liuxi Yang, Kapil Surlaker, Ravi Krishnamurthy, Michael Corwin, Jeremy Branscome, Krishnan Meiyyappan, Joseph I. Chamdani
  • Publication number: 20110099155
    Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.
    Type: Application
    Filed: January 4, 2011
    Publication date: April 28, 2011
    Applicant: TERADATA US INC.
    Inventors: James Shau, Krishnan Meiyyappan, Hung Tran, Ravi Krishnamurthy, Kapil Surlaker, Jeremy Branscome, Joseph I. Chamdani
  • Patent number: 7895151
    Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.
    Type: Grant
    Filed: June 23, 2008
    Date of Patent: February 22, 2011
    Assignee: Teradata US, Inc.
    Inventors: James Shau, Krishnan Meiyyappan, Hung Tran, Ravi Krishnamurthy, Kapil Surlaker, Jeremy Branscome, Joseph I Chamdani
  • Patent number: 7856461
    Abstract: Techniques are provided for maintaining high propagation availability for non-persistent messages. Destination-to-instance mapping information is provided to a listener process for a cluster database. The destination-to-instance mapping indicates the current owner instance of each single-instance destination within the cluster database. To establish a connection to a single-instance destination, a sending process sends a connection request to the global listener. The connection request identifies the desired destination queue, but not the owner instance of the queue. The global listener for the cluster database uses the destination-to-instance mapping to determine which instance is the current owner of the specified queue, and establishes a connection between the sending process and the appropriate owner instance.
    Type: Grant
    Filed: September 12, 2005
    Date of Patent: December 21, 2010
    Assignee: Oracle International Corporation
    Inventors: Ramkumar Venkatesan, Krishnan Meiyyappan, Alan Downing, James W. Stamos
  • Patent number: 7818386
    Abstract: Techniques for propagating messages in a distributed system are provided. A set of messages enqueued in a source queue are sent to one or more destination queues. An acknowledgement is received from each of the one or more destination queues, where the acknowledgement indicates which messages of the set of messages have been consumed at the particular destination queue. Based on the acknowledgements, one or more messages of the set messages are ceased to be maintained in the source queue.
    Type: Grant
    Filed: July 29, 2005
    Date of Patent: October 19, 2010
    Assignee: Oracle International Corporation
    Inventors: Kapil Surlaker, Krishnan Meiyyappan, Neerja Bhatt, Shailendra Mishra
  • Patent number: 7725902
    Abstract: A method and apparatus for propagating and managing data, transactions and events either within a database, or from one database to another is provided. In one embodiment, messages are propagated from a source to a first queue and a second queue with the queues associated with the same database. The connection from the source to each queue maintains its own propagation job. This method could also be employed with cluster databases.
    Type: Grant
    Filed: September 12, 2005
    Date of Patent: May 25, 2010
    Assignee: Oracle International Corporation
    Inventors: Krishnan Meiyyappan, Ramkumar Venkatesan, Shailendra Mishra
  • Publication number: 20090319550
    Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.
    Type: Application
    Filed: June 23, 2008
    Publication date: December 24, 2009
    Applicant: Kickfire, Inc.
    Inventors: James Shau, Krishnan Meiyyappan, Hung Tran, Ravi Krishnamurthy, Kapil Surlaker, Jeremy Branscome, Joseph I. Chamdani
  • Publication number: 20090319486
    Abstract: Embodiments of the present invention provide fine grain concurrency control for transactions in the presence of database updates. During operations, each transaction is assigned a snapshot version number or SVN. A SVN refers to a historical snapshot of the database that can be created periodically or on demand. Transactions are thus tied to a particular SVN, such as, when the transaction was created. Queries belonging to the transactions can access data that is consistent as of a point in time, for example, corresponding to the latest SVN when the transaction was created. At various times, data from the database stored in a memory can be updated using the snapshot data corresponding to a SVN. When a transaction is committed, a snapshot of the database with a new SVN is created based on the data modified by the transaction and the snapshot is synchronized to the memory.
    Type: Application
    Filed: June 23, 2008
    Publication date: December 24, 2009
    Applicant: Kickfire, Inc.
    Inventors: Kapil Surlaker, Ravi Krishnamurthy, Krishnan Meiyyappan, Alan Beck, Hung Tran, Jeremy Branscome, Joseph I. Chamdani
  • Publication number: 20090254532
    Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.
    Type: Application
    Filed: April 7, 2008
    Publication date: October 8, 2009
    Inventors: Liuxi Yang, Kapil Surlaker, Ravi Krishnamurthy, Michael Corwin, Jeremy Branscome, Krishnan Meiyyappan, Joseph I. Chamdani
  • Publication number: 20090254516
    Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.
    Type: Application
    Filed: April 7, 2008
    Publication date: October 8, 2009
    Inventors: Krishnan Meiyyappan, Liuxi Yang, Jeremy Branscome, Michael Corwin, Ravi Krishnamurthy, Kapil Surlaker, James Shau, Joseph I. Chamdani
  • Patent number: 7546613
    Abstract: A computer-implemented method of streaming a plurality of messages from a source queue to at least one destination queue over a computer network. The method may include steps of generating a remote procedure call, the remote procedure being configured to encapsulate at least header data, message data for each of the plurality of messages and an end of batch token, the header data being common to each of the plurality of messages and including an identification of the at least one destination queue, the end of batch token signaling that no further message data follows; sending the generated remote procedure call over the computer network to the destination queue identified in the header data, and dequeueing at least the message data for each of the plurality of messages from the source queue and streaming the dequeued messages over the network, and successively enqueueing each streamed message data into the at least one destination queue identified by the header data until the end of batch token is received.
    Type: Grant
    Filed: September 14, 2004
    Date of Patent: June 9, 2009
    Assignee: Oracle International Corporation
    Inventors: Nancy Reiko Ikeda, Ashwinder Singh Ahluwalia, Chao Liang, Krishnan Meiyyappan, Sreenivas Gollapudi, Lakshminarayanan Chidambaran