Raghupathi K Murthy

7685103, Mar 23, 2010

Sep 29, 2003

10/675265

Kevin Brown - San Rafael CA, US
Raghupathi Keshava Murthy - Union City CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707 3

Disclosed is a technique for processing predicates in an iterator function. When an iterator function included in a statement is invoked, one or more predicates included in the statement are obtained. The one or more predicates are applied to a row of data. If applying the one or more predicates results in a match, the row of data is returned. If applying the one or more predicates does not result in a match, a search is performed for another row of data for which application of the one or more predicates results in a match. Also disclosed is a technique for processing predicates in which a statement including an iterator function and one or more predicates is received. A qualification descriptor that describes the one or more predicates and one or more functions that are to be used to evaluate the one or more predicates is created. Then, the iterator function is invoked one or more times, until receiving a done indicator from the iterator function.

8615503, Dec 24, 2013

Jul 1, 2011

13/174823

Naresh K Chainani - Portland OR, US
Raghupathi K Murthy - Union City CA, US
Sitaram Vemulapalli - San Jose CA, US
Liping Zhang - Portland OR, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707703, 707704, 707769, 707830

Method for attaching one or more tables online to a range partitioned table, includes: starting a child transaction; obtaining an exclusive lock on a source table; obtaining an intent exclusive lock on a target table; soft invalidating queries on the target table where compiled form of queries are cached for reuse; attaching the source table(s) to the target table as a new partition(s) of the target table; modifying indices and table structure of the target table to reflect the attaching of the new partition; committing the child transaction; and releasing the exclusive lock and the intent exclusive lock, where concurrently running queries over the target table continue to run without considering the partition until the intent exclusive lock and the exclusive lock are released. Queries on the target table only consider existing partitions when the attaching is in progress. The new partition is available once the attach operation is complete.

20050182795, Aug 18, 2005

Feb 9, 2004

10/775739

Raghupathi Murthy - Union City CA, US

G06F017/30

707200000

Disclosed is a mechanism that can be implemented in database systems to support distributed transactions in heterogeneous systems. Once the transaction manager of a database system implements this mechanism, application developers and vendors can integrate new datasources into the transaction manager of the database system. This would simplify the application design and ensure the integrity of data and interactions. The interface and interactions between the transaction manager and external datasources (both structured and non-structured) conform to X/Open XA standards. Also disclosed is a technique to design the system catalogs for organizing the datasources and instances of the new datasources.

20070185912, Aug 9, 2007

Feb 8, 2006

11/350522

Ajay Gupta - Fremont CA, US
Raghupathi Murthy - Union City CA, US
Joaquim Zuzarte - Mountain View CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707200000

Various embodiments of a computer-implemented method, database environment and computer program product are provided which off-load the processing of a database operation. A first database is accessible to a first database server, and a second database is accessible to a second database server. Data is replicated from the first database to the second database, wherein the second database is substantially a copy of the first database. The first database server determines whether to off-load a database operation which would access the first database to the second database server. In response to determining to off-load the database operation, a command is sent to the second database server to perform the database operation. In response to receiving the command, the second database server accesses the second database to perform the database operation. A result of the database operation is received from the second database server.

20110320416, Dec 29, 2011

Jun 24, 2010

12/822436

Neeraj Kapoor - Fremont CA, US
Prasad S. Mujumdar - Fremont CA, US
Raghupathi K. Murthy - Union City CA, US
Ravi C. Pachipala - Fremont CA, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 17/30

707692, 707E17005

According to a present invention embodiment, a system avoids duplicate processing of database objects to ensure operation integrity in a database system including a plurality of nodes. The system comprises a computer system including at least one processor. The computer system receives a data operation from a secondary node, executes the received data operation, and identifies each database object that is relocated based on the executed data operation. The computer system communicates to the secondary node operations performed by the computer system for execution of the data operation and an indication of each relocated database object. The secondary node stores an identifier reflecting the relocation for each relocated database object to prevent re-processing of the relocated database objects for the data operation. Embodiments of the present invention further include a method and computer program product for avoiding duplicate processing of database objects in substantially the same manner described above.

20130238637, Sep 12, 2013

Mar 6, 2012

13/413535

Ajaykumar B. Gupte - San Jose CA, US
Raghupathi K. Murthy - Union City CA, US
Joaquim A. Zuzarte - Mountain View CA, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 17/30

707752, 707E17033

The efficient query processing on ordered views includes: obtaining a view definition for a view for database data; obtaining a query to be executed on the database data; identifying any columns in the view that are unnecessary for the query; after processing any predicates of the query, identifying any sorts in the view definition that are unnecessary or redundant in the query; rewriting the query to eliminate the unnecessary columns and unnecessary and redundant sorts; and executing the rewritten query without materializing the view. Thus, the query is rewritten in a way that avoids materializing the view and eliminates duplicate or unnecessary sorts. This reduces the number of rows to be sorted and eliminates unnecessary columns from materialization. These reductions lead to resource savings, including memory, temporary table space required for sorting, and CPU resources.

20220391367, Dec 8, 2022

Aug 15, 2022

17/888341

- Santa Clara CA, US
Raghupathi Keshava Murthy - Union City CA, US
Stephen Ching-Sing Yen - Atherton CA, US
Abhinav Dangeti - San Francisco CA, US

G06F 16/215
G06F 16/2453
G06F 16/22

A database system performs queries on fields storing arrays of a database (i.e., array fields) using de-duplication indexes. The system generates de-duplication indexes for array fields. The de-duplication indexes include unique entries for corresponding distinct values stored by the array fields. The system uses the de-duplication indexes to perform efficient queries specifying corresponding array fields. The system may further generate de-duplication indexes corresponding one or more fields storing various types of values. In various embodiments, the system selects an optimal index from various indexes usable to execute a query, such as a de-duplication index and a conventional index.

20220222250, Jul 14, 2022

Apr 1, 2022

17/711982

- Santa Clara CA, US
Raghupathi Keshava Murthy - Union City CA, US
Marco Greco - Birchanger, GB
Prathibha Bisarahalli Prabhakar - Bangalore, IN

G06F 16/2453
G06F 16/93
G06F 16/2457
G06F 16/2458

A document-oriented database system generates an optimal query execution plan for database queries on an untyped data field included in a collection of documents. The system generates histograms for multiple types of data stored by the untyped data field and uses the histograms to assign costs to operators usable to execute the database query. The system generates the optimal query execution plan by selecting operators based on the assigned costs. In various embodiments, the untyped data field stores scalars, arrays, and objects.