Patents by Inventor Krishna Kunchithapadam
Krishna Kunchithapadam 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: 11080204Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.Type: GrantFiled: June 7, 2019Date of Patent: August 3, 2021Assignee: Oracle International CorporationInventors: Siddharth Teotia, Krishna Kunchithapadam, Tirthankar Lahiri, Jesse Kamp, Michael J. Gleeson, Juan R. Loaiza, Garret F. Swart, Neil J. S. MacNaughton, Kam Shergill
-
Patent number: 10803039Abstract: Techniques are provided for enabling a requesting entity to retrieve data that is managed by a database server instance from the volatile memory of a server machine that is executing the database server instance. The techniques allow the requesting entity to retrieve the data from the volatile memory of the host server machine without involving the database server instance in the retrieval operation. Because the retrieval does not involve the database server instance, the retrieval may succeed even when the database server instance has stalled or become unresponsive. In addition, direct retrieval of data using the techniques described herein will often be faster and more efficient than retrieval of the same information through conventional interaction with the database server instance.Type: GrantFiled: May 26, 2017Date of Patent: October 13, 2020Assignee: Oracle International CorporationInventors: Siddharth Teotia, Krishna Kunchithapadam, Jesse Kamp, Tirthankar Lahiri, Michael J. Gleeson, Juan R. Loaiza, Garret F. Swart, Neil J. S. MacNaughton, Kam Shergill
-
Publication number: 20190294558Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.Type: ApplicationFiled: June 7, 2019Publication date: September 26, 2019Inventors: Siddharth Teotia, Krishna Kunchithapadam, Tirthankar Lahiri, Jesse Kamp, Michael J. Gleeson, Juan R. Loaiza, Garret F. Swart, Neil J.S. MacNaughton, Kam Shergill
-
Patent number: 10346315Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.Type: GrantFiled: May 26, 2017Date of Patent: July 9, 2019Assignee: Oracle International CorporationInventors: Siddharth Teotia, Krishna Kunchithapadam, Tirthankar Lahiri, Jesse Kamp, Michael J. Gleeson, Juan R. Loaiza, Garret F. Swart, Neil J. S. MacNaughton, Kam Shergill
-
Publication number: 20180341596Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.Type: ApplicationFiled: May 26, 2017Publication date: November 29, 2018Inventors: Siddharth Teotia, Krishna Kunchithapadam, Tirthankar Lahiri, Jesse Kamp, Michael J. Gleeson, Juan R. Loaiza, Garret F. Swart, Neil J.S. MacNaughton, Kam Shergill
-
Publication number: 20180341653Abstract: Techniques are provided for enabling a requesting entity to retrieve data that is managed by a database server instance from the volatile memory of a server machine that is executing the database server instance. The techniques allow the requesting entity to retrieve the data from the volatile memory of the host server machine without involving the database server instance in the retrieval operation. Because the retrieval does not involve the database server instance, the retrieval may succeed even when the database server instance has stalled or become unresponsive. In addition, direct retrieval of data using the techniques described herein will often be faster and more efficient than retrieval of the same information through conventional interaction with the database server instance.Type: ApplicationFiled: May 26, 2017Publication date: November 29, 2018Inventors: Siddharth Teotia, Krishna Kunchithapadam, Jesse Kamp, Tirthankar Lahiri, Michael J. Gleeson, Juan R. Loaiza, Garret F. Swart, Neil J.S. MacNaughton, Kam Shergill
-
Patent number: 10120895Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.Type: GrantFiled: January 22, 2018Date of Patent: November 6, 2018Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Jesse Kamp, Amit Ganesh, Vineet Marwah, Vivekanandhan Raja, Tirthankar Lahiri, Allison L. Holloway, Sanket Hase, Shasank K. Chavan, Niloy Mukherjee, Teck Hua Lee, Michael J. Gleeson, Krishna Kunchithapadam
-
Publication number: 20180144023Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.Type: ApplicationFiled: January 22, 2018Publication date: May 24, 2018Inventors: Jesse Kamp, Amit Ganesh, Vineet Marwah, Vivekanandhan Raja, Tirthankar Lahiri, Allison L. Holloway, Sanket Hase, Shasank K. Chavan, Niloy Mukherjee, Teck Hua Lee, Michael J. Gleeson, Krishna Kunchithapadam
-
Patent number: 9881048Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.Type: GrantFiled: October 13, 2015Date of Patent: January 30, 2018Assignee: Oracle International CorporationInventors: Jesse Kamp, Amit Ganesh, Vineet Marwah, Vivekanandhan Raja, Tirthankar Lahiri, Allison L. Holloway, Sanket Hase, Shasank K. Chavan, Niloy Mukherjee, Teck Hua Lee, Michael J. Gleeson, Krishna Kunchithapadam
-
Patent number: 9292564Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.Type: GrantFiled: July 21, 2014Date of Patent: March 22, 2016Assignee: Oracle International CorporationInventors: Jesse Kamp, Amit Ganesh, Vineet Marwah, Vivekanandhan Raja, Tirthankar Lahiri, Allison L. Holloway, Sanket Hase, Shasank K. Chavan, Niloy Mukherjee, Teck Hua Lee, Michael J. Gleeson, Krishna Kunchithapadam
-
Publication number: 20160034214Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.Type: ApplicationFiled: October 13, 2015Publication date: February 4, 2016Inventors: Jesse Kamp, Amit Ganesh, Vineet Marwah, Vivekanandhan Raja, Tirthankar Lahiri, Allison L. Holloway, Sanket Hase, Shasank K. Chavan, Niloy Mukherjee, Teck Hua Lee, Michael J. Gleeson, Krishna Kunchithapadam
-
Publication number: 20150088830Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.Type: ApplicationFiled: July 21, 2014Publication date: March 26, 2015Inventors: Jesse Kamp, Amit Ganesh, Vineet Marwah, Vivekanandhan Raja, Tirthankar Lahiri, Allison L. Holloway, Sanket Hase, Shasank K. Chavan, Niloy Mukherjee, Teck Hua Lee, Michael J. Gleeson, Krishna Kunchithapadam
-
Patent number: 8977597Abstract: Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to storage as a result of the merge operation.Type: GrantFiled: November 6, 2013Date of Patent: March 10, 2015Assignee: Oracle International CorporationInventors: Amit Ganesh, Juan R. Loaiza, Krishna Kunchithapadam
-
Patent number: 8775479Abstract: A method, system and computer program product are described for state maintenance of a large object. In one approach, the method, system and computer program product perform by associating one or more buffers with a transaction involving a large object, the large object data may be accessed using the one or more buffers during the transaction, and storing data for the large object from the one or more buffers in one or more sets of contiguous blocks. In one approach, a system performs state maintenance of a large object with a cache that associates one or more buffers with a transaction involving a large object, the large object data may be accessed using the one or more buffers during the transaction, and the cache stores large object data from the one or more buffers in one or more sets of contiguous blocks in storage.Type: GrantFiled: July 30, 2007Date of Patent: July 8, 2014Assignee: Oracle International CorporationInventors: Nirman Kumar, Kaan Baloglu, Dheeraj Pandey, Krishna Kunchithapadam, Sujatha Muthulingam, Vipin Gokhale, Bharat Baddepudi
-
Publication number: 20140067767Abstract: Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to storage as a result of the merge operation.Type: ApplicationFiled: November 6, 2013Publication date: March 6, 2014Applicant: Oracle International CorporationInventors: Amit Ganesh, Juan R. Loaiza, Krishna Kunchithapadam
-
Patent number: 8595248Abstract: Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to disk storage as a result of the merge operation.Type: GrantFiled: May 20, 2009Date of Patent: November 26, 2013Assignee: Oracle International CorporationInventors: Amit Ganesh, Juan R. Loaiza, Krishna Kunchithapadam
-
Patent number: 8346778Abstract: Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.Type: GrantFiled: May 20, 2009Date of Patent: January 1, 2013Assignee: Oracle International CorporationInventors: Amit Ganesh, Juan R. Loaiza, Krishna Kunchithapadam
-
Patent number: 8195702Abstract: Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.Type: GrantFiled: July 30, 2007Date of Patent: June 5, 2012Assignee: Oracle International CorporationInventors: Shrikanth Shankar, Ramesh Kumar, Krishna Kunchithapadam, Ananth Raghavan, Dheeraj Pandey, Amit Ganesh, Joy M. Forsythe
-
Patent number: 7886124Abstract: Disclosed is a system and method for implementing space management for large objects stored in the computing system. According to some approaches, storage of large objects are managed by dynamically creating contiguous chunks of storage space of varying lengths. The length of each chunk may vary depending upon object size being stored, fragmentation of the storage space, available free space, and/or expected length of the object.Type: GrantFiled: July 30, 2007Date of Patent: February 8, 2011Assignee: Oracle International CorporationInventors: Sujatha Muthulingam, Amit Ganesh, Dheeraj Pandey, Niloy Mukherjee, Wei Zhang, Krishna Kunchithapadam
-
Publication number: 20090292679Abstract: Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.Type: ApplicationFiled: May 20, 2009Publication date: November 26, 2009Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Amit Ganesh, Juan R. Loaiza, Krishna Kunchithapadam