Seema P Sundara

6920460, Jul 19, 2005

May 29, 2002

10/159360

Jagannathan Srinivasan - Nashua NH, US
Seema Sundara - Nashua NH, US
Nipun Agarwal - Santa Clara CA, US
Ying Hu - Nashua NH, US
Timothy Chorma - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06F017/30

707102

Domain indexes (indexes created and maintained by user-defined indexing schemes) are managed on partitioned database objects that store data using a system-managed approach. Partition maintenance operations performed on the partitioned database objects cause corresponding partition maintenance operations to be performed on the domain indexes. Partition maintenance operations are performed on both the database objects and the indexes by a system-supplied partition manager. Changes in the partition maintenance operations or partitioning methods supplied by the database management system do not affect user-supplied code which is provided by the user-defined indexing scheme. User-supplied code is therefore partition operation-unaware.

7617235, Nov 10, 2009

Apr 12, 2005

11/104718

Jagannathan Srinivasan - Nashua NH, US
Seema Sundara - Nashua NH, US
Nipun Agarwal - Santa Clara CA, US
Ying Hu - Nashua NH, US
Timothy Chorma - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707102

A domain index for a partitioned database can be created using a user-defined indexing scheme. Partition maintenance operations performed on the partitioned database objects cause corresponding partition maintenance operations to be performed on the domain indexes. The user-supplied partitioning code is partition operation-unaware.

7774346, Aug 10, 2010

Aug 29, 2005

11/215639

Ying Hu - Nashua NH, US
Timothy Chorma - Nashua NH, US
Seema Sundara - Nashua NH, US
Jagannathan Srinivasan - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06F 7/00

707745, 707715, 707716

A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. Objects containing bitmap values may be indexed by means of an index tree that includes summary bitmap values.

7844600, Nov 30, 2010

Jul 13, 2007

11/827796

Ying Hu - Nashua NH, US
Seema Sundara - Nashua NH, US
Jagannathan Srinivasan - Nashua NH, US

Oracle International Corp. - Redwood Shores CA

G06F 7/00
G06F 17/30

707717, 707715, 707716, 707718

Systems, methodologies, media, and other embodiments associated with supporting materialized views with user-defined aggregates are described. One example system includes logic for exposing a set of interface actions to support a user-defined aggregate in a materialized view associated with a base table. The materialized view may store both the user-defined aggregate and a user-defined aggregate context that facilitates logically connecting the user-defined aggregate to the base table. The example system may also include logic for supporting the user-defined aggregate. The support may be based on the set of interface actions. Example systems and methods may, therefore, facilitate incremental updating of the materialized view and/or rewriting a query to access the materialized view.

7925647, Apr 12, 2011

Feb 7, 2008

12/027918

Dinesh Das - Redwood City CA, US
Wesley Lin - West Covina CA, US
Seema Sundara - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707719, 7079992, 707715, 707718, 707720

In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs. From the plurality of execution plans, the query optimizer selects an optimal execution plan that is associated with an optimal total cost of the plurality of total costs.

7953728, May 31, 2011

May 18, 2007

11/804502

Ying Hu - Nashua NH, US
Seema Sundara - Nashua NH, US
Jagannathan Srinivasan - Nashua NH, US

Oracle International Corp. - Redwood Shores CA

G06F 17/30

707719, 707720

Systems, methodologies, media, and other embodiments associated with supporting queries with soft time constraints are described. One exemplary system embodiment includes logic for accepting a query having a soft time constraint. The example system may also include logic for rewriting the query having the soft time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the soft time constraint.

7987164, Jul 26, 2011

Jan 9, 2008

12/007325

Ying Hu - Nashua NH, US
Seema Sundara - Nashua NH, US
Jagannathan Srinivasan - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06F 7/00
G06F 17/00

707696, 707702

A method, system, and computer program product provides improved performance for rebuild of user-defined indexes during partition maintenance operations (partition split, merge, and move). A method of maintaining a index of a partitioned database table comprises performing a partition maintenance operation on the partitioned database table wherein a plurality of rows of the partitioned database table are moved from one partition to another, storing mapping information for at least some of the plurality of moved rows, including an old mapping for each of the moved rows and a corresponding new mapping for each of the moved rows, and when rebuilding the index, replacing an old mapping in the index for each of the plurality of moved rows with the corresponding stored new mapping for each of the plurality of moved rows.

8015180, Sep 6, 2011

May 18, 2007

11/804508

Ying Hu - Nashua NH, US
Seema Sundara - Nashua NH, US
Jagannathan Srinivasan - Nashua NH, US

Oracle International Corp. - Redwood Shores CA

G06F 17/30

707719, 707720

Systems, methodologies, media, and other embodiments associated with supporting queries with hard time constraints are described. One exemplary system embodiment includes logic for accepting a query having a hard time constraint. The example system may also include logic for selectively rewriting the query having the hard time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the hard time constraint. The example system may also include logic for establishing a timer(s) associated with the rewritten query.