Patents by Inventor Paramesh S. Desai
Paramesh S. Desai 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: 9928274Abstract: Embodiments presented herein provide techniques for setting different methods of skipping duplicate values when executing a query statement in a relational database. A distance between a two distinct keys in an index, a current index key and a next distinct index key, are estimated. Based on the estimated distance, an appropriate duplicate-skipping method is determined. If the proximity between the distinct keys is relatively far apart (e.g., the keys reside in index pages that are at least an index page apart), then a “big skip” method is performed. Otherwise, if the proximity between the distinct keys is relatively near (e.g., the keys reside in the same index page), then a “little skip” method is performed.Type: GrantFiled: December 1, 2014Date of Patent: March 27, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Terence P. Purcell, Thomas A. Beavin, Li Xia, Michael R. Shadduck, Paramesh S. Desai, Qianyang Yu
-
Patent number: 9892158Abstract: Embodiments presented herein provide techniques for setting different methods of skipping duplicate values when executing a query statement in a relational database. A distance between a two distinct keys in an index, a current index key and a next distinct index key, are estimated. Based on the estimated distance, an appropriate duplicate-skipping method is determined. If the proximity between the distinct keys is relatively far apart (e.g., the keys reside in index pages that are at least an index page apart), then a “big skip” method is performed. Otherwise, if the proximity between the distinct keys is relatively near (e.g., the keys reside in the same index page), then a “little skip” method is performed.Type: GrantFiled: January 31, 2014Date of Patent: February 13, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Terence P. Purcell, Thomas A. Beavin, Li Xia, Michael R. Shadduck, Paramesh S. Desai, Qianyang Yu
-
Publication number: 20150220595Abstract: Embodiments presented herein provide techniques for setting different methods of skipping duplicate values when executing a query statement in a relational database. A distance between a two distinct keys in an index, a current index key and a next distinct index key, are estimated. Based on the estimated distance, an appropriate duplicate-skipping method is determined. If the proximity between the distinct keys is relatively far apart (e.g., the keys reside in index pages that are at least an index page apart), then a “big skip” method is performed. Otherwise, if the proximity between the distinct keys is relatively near (e.g., the keys reside in the same index page), then a “little skip” method is performed.Type: ApplicationFiled: January 31, 2014Publication date: August 6, 2015Applicant: International Business Machines CorporationInventors: Terence P. PURCELL, Thomas A. BEAVIN, Li XIA, Michael R. SHADDUCK, Paramesh S. DESAI, Qianyang YU
-
Publication number: 20150220596Abstract: Embodiments presented herein provide techniques for setting different methods of skipping duplicate values when executing a query statement in a relational database. A distance between a two distinct keys in an index, a current index key and a next distinct index key, are estimated. Based on the estimated distance, an appropriate duplicate-skipping method is determined. If the proximity between the distinct keys is relatively far apart (e.g., the keys reside in index pages that are at least an index page apart), then a “big skip” method is performed. Otherwise, if the proximity between the distinct keys is relatively near (e.g., the keys reside in the same index page), then a “little skip” method is performed.Type: ApplicationFiled: December 1, 2014Publication date: August 6, 2015Inventors: Terence P. PURCELL, Thomas A. BEAVIN, Li XIA, Michael R. SHADDUCK, Paramesh S. DESAI, Qianyang YU
-
Patent number: 7774372Abstract: A computer system and a relational database management system (RDMS) computer program product are described for interfacing a number of concurrently running database sessions with a large database in which a plurality of local temporary object database descriptors are used in lieu of a single global temporary object database descriptor where the global and each of the local temporary object database descriptors include identifiers for temporary objects, each of the local temporary object database descriptors is associated with a single database session and each of the global database descriptors is shared among multiple database sessions.Type: GrantFiled: May 16, 2007Date of Patent: August 10, 2010Assignee: International Business Machines CorporationInventors: Ramani M. Croisettier, Paramesh S. Desai, James Z. Teng
-
Publication number: 20080288561Abstract: A computer system and a relational database management system (RDMS) computer program product are described for interfacing a number of concurrently running database sessions with a large database in which a plurality of local temporary object database descriptors are used in lieu of a single global temporary object database descriptor where the global and each of the local temporary object database descriptors include identifiers for temporary objects, each of the local temporary object database descriptors is associated with a single database session and each of the global database descriptors is shared among multiple database sessions.Type: ApplicationFiled: May 16, 2007Publication date: November 20, 2008Applicant: International Business Machines CorporationInventors: RamanaKumari M. Croisettier, Paramesh S. Desai, James Z. Teng
-
Publication number: 20080270407Abstract: A system for ensuring referential integrity in a concurrent transaction database environment is disclosed. The system determines when an update to a dependent object requires special processing, and if special processing is required, locating and locking parent objects of the dependent object in share mode prior to committing the update to the dependent object.Type: ApplicationFiled: June 17, 2008Publication date: October 30, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Paramesh S. DESAI, Julie A. WATTS, James Z. TENG
-
Publication number: 20080243966Abstract: A method and system to manage temporary storage space of a relational database management system by receiving a data segment allocation request from an application, allocating a data segment to the application, marking the data segment as allocated in a space map page, and indicating a usage status of the data segment. The method also includes receiving a mass delete command from the application, indicating reception of the mass delete command in a table-related control block, and marking the data segment as unavailable in the space map page. The method may also include indicating reception of the mass delete commit command in the table-related control block to enable the application to reuse the data segment.Type: ApplicationFiled: April 2, 2007Publication date: October 2, 2008Inventors: RamanaKumari M. Croisettier, Paramesh S. Desai, James Z. Teng
-
Patent number: 7158996Abstract: Provided are a method, system, and program for managing a database. A request is processed to create an index on at least one key column of a table in a computer readable medium. A determination is made of table partitions in which rows of the table are stored. One index partition is generated for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes a key value from at least one column in a corresponding table row in the table partition associated with the index partition and a location identifier identifying the corresponding table row in the corresponding table partition. In certain embodiments, a technique is implemented during queries to limit the search to a subset of the multiple index partitions when possible and return rows in the order of the key columns of the index while the same range of key values can exist across multiple index partitions.Type: GrantFiled: May 16, 2003Date of Patent: January 2, 2007Assignee: International Business Machines CorporationInventors: RamanaKumari M. Croisettier, Paramesh S. Desai, Julie Ann Watts
-
Patent number: 7146365Abstract: Disclosed is a method, system, and program for database query execution. A range of data pages is assigned to each of multiple parallel tasks. For each of the multiple parallel tasks, the range of data pages is mapped to one or more physical partitions, and a data partitioned secondary index partition associated with each of the one or more physical partitions is identified. Each of the multiple parallel tasks is executed to process the database query against the assigned range of data pages using the one or more data partitioned secondary index partitions.Type: GrantFiled: January 27, 2003Date of Patent: December 5, 2006Assignee: International Business Machines CorporationInventors: Terry Dennis Allen, Paramesh S. Desai, Akira Shibamiya, Hong Sang Tie, Annie S. Tsang
-
Publication number: 20040236744Abstract: A method for ensuring referential integrity in a concurrent transaction database environment is disclosed. The method includes determining when an update to a dependent object requires special processing, and if special processing is required, locating and locking parent objects of the dependent object in share mode prior to committing the update to the dependent object.Type: ApplicationFiled: May 22, 2003Publication date: November 25, 2004Inventors: Paramesh S. Desai, Julie A. Watts, James Z. Teng
-
Publication number: 20040148273Abstract: Disclosed is a method, system, and program for database query execution. A range of data pages is assigned to each of multiple parallel tasks. For each of the multiple parallel tasks, the range of data pages is mapped to one or more physical partitions, and a data partitioned secondary index partition associated with each of the one or more physical partitions is identified. Each of the multiple parallel tasks is executed to process the database query against the assigned range of data pages using the one or more data partitioned secondary index partitions.Type: ApplicationFiled: January 27, 2003Publication date: July 29, 2004Applicant: International Business Machines CorporationInventors: Terry Dennis Allen, Paramesh S. Desai, Akira Shibamiya, Hong Sang Tie, Annie S. Tsang
-
Publication number: 20040148293Abstract: Provided are a method, system, and program for managing a database. A request is processed to create an index on at least one key column of a table in a computer readable medium. A determination is made of table partitions in which rows of the table are stored. One index partition is generated for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes a key value from at least one column in a corresponding table row in the table partition associated with the index partition and a location identifier identifying the corresponding table row in the corresponding table partition. In certain embodiments, a technique is implemented during queries to limit the search to a subset of the multiple index partitions when possible and return rows in the order of the key columns of the index while the same range of key values can exist across multiple index partitions.Type: ApplicationFiled: May 16, 2003Publication date: July 29, 2004Applicant: International Business Machines CorporationInventors: RamanaKumari M. Croisettier, Paramesh S. Desai, Julie Ann Watts