Hakan Jakobsson, 63338 Spear St UNIT 17D, San Francisco, CA 94105

6615206, Sep 2, 2003

Jun 28, 2002

10/186461

Hakan Jakobsson - San Francisco CA
Ari Mozes - San Carlos CA
Andrew Witkowski - Foster City CA
Fei Ge - San Jose CA

Oracle International Corporation - Redwood Shores CA

G06F 1730

707 3, 707 4

Techniques for processing, in a database management system, a query referencing a plurality of tables of a database include determining whether a join should be performed between a first table and a second table. The determination is based on a particular set of one or more columns of the second table referenced in the query and a join index on the first table for an index key column from the second table. If it is determined that the join should not be performed, the query is processed without performing the join between the first table and the second table. By avoiding one or more joins, substantial savings in the consumption of computational resources are achieved.

6957211, Oct 18, 2005

May 6, 2002

10/139864

Mikhail Tyulenev - Belmont CA, US
Hakan Jakobsson - San Francisco CA, US
Mohamed Ziauddin - Pleasanton CA, US

Oracle International Corporation - Redwood Shores CA

G06F017/30

707 2

An embodiment of the invention optimizes a DBMS operation based upon multiple criteria, such as input/outputs and CPU time. Multiple optimization criteria are normalized to a common unit of measurement. Normalized optimization criteria are used in a cost function. Estimated execution times are calculated under a variety of different workload environments. Cost values are scaled to a variety of computer architectures.

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.

7167852, Jan 23, 2007

May 1, 2002

10/137102

Rafi Ahmed - Fremont CA, US
Hakan Jakobsson - San Francisco CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30
G06F 9/44

707 1, 707 3, 717114

Statements having non-commutative connection conditions are optimized by replacing the non-commutative connection conditions with equivalent expressions that allow for consideration of additional connection orders that would otherwise violate the ordering rules of the non-commutative connection condition. Elements on the right-hand side of a non-commutative connection condition are converted into distinct results elements, thereby allowing the elements to be used on the left-hand side of a commutative connection operator, while preserving accuracy of the statement results set. This increased set of connection orders is evaluated and the execution plan for the optimal connection order is selected.

7213012, May 1, 2007

May 9, 2003

10/435228

Hakan Jakobsson - San Francisco CA, US
William McKenna - Santa Cruz CA, US
Mohamed Ziauddin - Pleasanton CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707 2, 707 3

Described herein are approaches to implementing dynamic sampling in a way that lessens or eliminates the additional overhead incurred to perform dynamic sampling. Also described are techniques for determining characteristics about predicates not previously determined by conventional techniques for dynamic sampling. Dynamic sampling is used by a query optimizer to dynamically estimate predicate selectivities and statistics. When a database statement is received by a database server, an initial analysis of the database statement is made to determine the efficacy of dynamic sampling, that is, to determine whether optimization of the query would benefit from dynamic sampling and whether performance is not excessively impacted by the dynamic sampling process. If this analysis determines dynamic sampling should be used, then dynamic sampling is undertaken.

7756853, Jul 13, 2010

Aug 27, 2004

10/927893

Wei Li - San Carlos CA, US
Ari W. Mozes - Lexington MA, US
Hakan Jakobsson - San Francisco CA, US

Oracle International Corporation - Redwood Shores CA

G06F 7/00

707713, 707720

A method and mechanism for performing improved frequent itemset operations is provided. A set of item groups are divided into a plurality of subsets. Each item group is composed of a set of data items. Possible combinations of data items that may frequently appear together in the same item group are referred to as candidate combinations. Candidate combinations comprising a first set of data items are identified, and thereafter the occurrence of each candidate combination in any item group in each subset is counted by comparing item bitmaps, associated with items in the candidate combination, in each subset in turn. The comparison of item bitmaps is performed in volatile memory. A total frequent itemset count that describes the frequency of candidate combinations in items groups across all subsets is obtained. Thereafter, the total frequent itemset count for candidate combinations having a larger number of data items may be determined.

8224813, Jul 17, 2012

Oct 20, 2006

11/584255

Sanjay Kaluskar - Menlo Park CA, US
Varun Malhotra - Palo Alto CA, US
Tirthankar Lahiri - Palo Alto CA, US
Juan Loaiza - Woodside CA, US
Sumanta Chatterjee - Fremont CA, US
Dmitry Potapov - Emerald Hills CA, US
Margaret Susairaj - Sunnyvale CA, US
Hakan Jakobsson - San Francisco CA, US

Oracle International Corporation - Redwood Shores CA

G06F 7/00
G06F 17/30
G06F 12/00
G06F 13/00
G06F 13/28

707719, 711117

A method, system, and computer program product for cost based analysis for data access in a database management system. In one approach, the method, system, and computer program product identifies data to access. A first cost for direct I/O storage access and a second cost for cache access are then determined for accessing the data. A comparison between the first cost and the second cost is then performed. Finally, a first portion of identified data is accessed based at least in part upon the comparison.

2006020, Sep 14, 2006

May 12, 2006

11/433842

Sanjay Kaluskar - Mountain View CA, US
Namit Jain - Emeryville CA, US
Hakan Jakobsson - San Francisco CA, US
Graham Wood - El Granada CA, US

G06F 17/30

707004000

The methods and systems for database statement execution plan optimization exploit bind variable data available on the network to build and optimize an execution plan for the statement. A system for database statement execution plan optimization comprises a bind variable analyzer, a frame allocator, and an optimizer, in addition to a parser for parsing and analyzing the statement, a type checker for type checking the statement, and a tree builder for building an expression tree.