Mohamed Zait

6609131, Aug 19, 2003

Sep 27, 1999

09/406482

Mohamed Zait - Sunnyvale CA
Beniot Dageville - Redwood Shores CA

Oracle International Corporation - Redwood Shores CA

G06F 1700

707102, 707 3, 707100

Techniques are disclosed for expanding the concept of partitioning in variety of ways. In particular techniques are provided for performing multiple-dimension partitioning. In multiple-dimension partitioning, a database object is divided into partitions based on one criteria, and each of those resulting partitions is divided into sub-partitions based on a second criteria. The process of partitioning partitions based on different criteria may be repeated across any number of dimensions. Entirely different partitioning techniques may be used for each level of partitioning. The database server takes advantage of partitions when processing queries that include joins. In particular, techniques are provided for performing a full parallel partitioned-wise join, and a partial parallel partition-wise join. In a partial parallel partition-wise join, one of the join tables is statically partitioned on the join key and another join table is dynamically partitioned in a way that corresponds to the partition criteria of the statically partitioned table. In a full parallel partition-wise join, both of the tables involved in the join have already been statically partitioned based on the same criteria.

6665684, Dec 16, 2003

Sep 27, 1999

09/405980

Mohamed Zait - Sunnyvale CA
Benoit Dageville - Redwood Shores CA
Andre Kruglikov - Atherton CA
Gianfranco Putzolu - San Francisco CA

Oracle International Corporation - Redwood Shores CA

G06F 1700

707102, 707100, 707101, 707 1, 707 2, 707 3

Techniques are disclosed for expanding the concept of partitioning in variety of ways. In particular techniques are provided for performing multiple-dimension partitioning. In multiple-dimension partitioning, a database object is divided into partitions based on one criteria, and each of those resulting partitions is divided into sub-partitions based on a second criteria. The process of partitioning partitions based on different criteria may be repeated across any number of dimensions. Entirely different partitioning techniques may be used for each level of partitioning. The database server takes advantage of partitions when processing queries by selectively accessing a subset of partitions on disk or reducing the number of internal join operations.

6931390, Aug 16, 2005

Feb 27, 2001

09/796001

Mohamed Zait - Sunnyvale CA, US
Benoit Dageville - Redwood Shores CA, US

Oracle International Corporation - Redwood Shores CA

G06F017/30

707 2, 707101

The present invention is directed to a method and mechanism for partitioning using information not directly located in the object being partitioned. According to an embodiment of the invention, foreign key-primary key relationships are utilized to create join conditions between multiple database tables to implement partitioning of a database object. Also, disclosed are methods and mechanisms to perform partition pruning.

6957225, Oct 18, 2005

May 30, 2002

10/160585

Mohamed Zait - Sunnyvale CA, US
Abhinav Gupta - Palo Alto CA, US
Benoit Dageville - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F017/30

707102, 707 2, 707100

Methods are provided for automatically discovering correlations between values in columns of tables. A set of significantly correlated columns is identified by identifying correlated columns, and by determining the significance of the correlation between the correlated columns from one or more tables. If the correlated columns are considered significantly correlated, a correlation table is constructed that includes records representing distinct combinations of values corresponding to the correlated columns. Embodiments include methods for identifying correlated columns, for determining the significance of the correlation between the correlated columns, and for using the resultant correlation table to enhance performance of a query execution process. One particular embodiment provides for using a correlation table for partition pruning a partitioned table, with respect to a query execution plan.

6965891, Nov 15, 2005

Feb 27, 2001

09/795904

Hakan Jakobsson - San Francisco CA, US
Mohamed Zait - Sunnyvale CA, US
Benoit Dageville - Redwood Shores CA, US

Oracle International Corporation - Redwood Shores CA

G06F017/30

707 5, 7071041

A method and system for performing partition pruning for queries that include a non-single table predicate is disclosed. According to an embodiment of the invention, this type of query is processed by performing a transformation of the query to include additional predicates comprising subqueries. The transformed query includes single table predicates on the partitioning column of the table being queried, based upon join predicates that exist in the original query.

7020661, Mar 28, 2006

Jul 10, 2002

10/193620

Thierry Cruanes - Redwood City CA, US
Mohamed Zait - Sunnyvale CA, US
Benoit Dageville - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707103R, 707100, 707101, 707102, 7071041

Techniques for eliminating one or more portions of a data object from any join step of an operation that joins multiple data objects include determining that an operation joins a first data object and a second data object. The second data object includes multiple portions. Each of multiple data units of the first data object is scanned. Based on data in the data units of the first data object, information is generated. The information indicates a portion of the second data object for exclusion. The indicated portion is excluded from an output of the operation. Only one or more portions of the second data object that are not indicated for exclusion in the information are included in a particular join step involving the second data object. By pruning a large second table, such as a fact table, the computational resources consumed by the joins are substantially reduced.

7409517, Aug 5, 2008

Oct 1, 2001

09/969290

Benoit Dageville - Redwood Shores CA, US
Mohamed Zait - Sunnyvale CA, US

Oracle International Corporation - Redwood Shores CA

G06F 12/02

711170

An application program (such as a database) is responsive to a value (also called externally-set global value) that defines the amount of memory to be used by the application program for functions (such as queries) performed by the application program. In one embodiment, a sequence of instructions (also called “memory broker”) uses the externally-set global value to compute one or more internal values that are then used when allocating memory. The memory broker dynamically revises the internal value(s) based on memory being allocated for the functions, thereby to form a feedback loop.

7447676, Nov 4, 2008

Apr 21, 2003

10/420475

Mohamed Zait - San Jose CA, US
Ari Mozes - San Carlos CA, US
Cetin Ozbutun - San Carlos CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30
G06F 15/00

707 3, 712 30

A method and system of collecting execution statistics of query statements is disclosed. An execution plan is generated for a query statement in one embodiment of the invention. The execution plan includes one or more operations. One of the one or more operations is selected. The selected execution plan is then executed and a plurality of execution statistics of the selected operation is collected.