Kenneth J Jacobs

US Patent:

6959927, Nov 1, 2005

Filed:

Oct 19, 2001

Appl. No.:

10/032676

Inventors:

Thomas W. Jacobs - Las Vegas NV, US
Kenneth M. Jacobs - Littleton CO, US

International Classification:

A63F001/00

US Classification:

273292, 463 12

Abstract:

A gaming system and method based on a Blackjack card game using a dealer hold criteria and allowing a single player at a location to play blackjack against a plurality of dealers from a casino. The system and method allows the player to select the number of dealer hand positions, a player hand position, wager placement positions corresponding with each dealer hand position. The system compares, based on the rules of Blackjack, the player hold hand to each dealer hold hand to determine if the player hold hand wins over any of the dealer hold hands. The single player is then credited for each dealer hold hand that is beat by the player hold hand and the casino is credited for each dealer hold hand that is not beat by a player hold hand, so that the single player carries out multiple games of blackjack based on the player hold hand.

US Patent:

7941408, May 10, 2011

Filed:

Sep 3, 2004

Appl. No.:

10/934079

Inventors:

Bipul Sinha - Foster City CA, US
Vivekanandhan Raja - Foster City CA, US
Amit Ganesh - San Jose CA, US
Kenneth R. Jacobs - San Mateo CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707685

Abstract:

Disclosed is a mechanism, system, interface, and process to allow specification of a new table decoration clause to obtain one or more past version of one or more data items. The version query provides for a direct interface to get multiple versions of the row(s). In addition, information about the past versions can be retrieved and displayed along with the past versions. Also disclosed are algorithms, mechanisms, and processes that are employed to implement a query upon past versions. In one approach, the version query can be defined as either “rowid”-based access or non-rowid based access. With rowid based access, a given rowid is used to identify the data for which past versions are desired. Also disclosed is a process for determining one or more life intervals when given a key.

US Patent:

60472855, Apr 4, 2000

Filed:

Apr 6, 1998

Appl. No.:

9/056392

Inventors:

Kenneth R. Jacobs - San Mateo CA
Robert J. Jenkins - Foster City CA

Assignee:

Oracle Corporation - Redwood Shores CA

International Classification:

G06F 1730

US Classification:

707 4

Abstract:

The present invention provides a uniqueness-required index and a corresponding non-uniqueness count to support deferred uniqueness constraint enforcement. A uniqueness-required index stores duplicate occurrences of indexed data values that occur during statement or transaction processing. The non-uniqueness count associated with the uniqueness-required index provides a count of the number of indexed data values that occur more than once in the index. Where a non-uniqueness count is not equal to zero, a uniqueness constraint violation remains unresolved. Where an unresolved constraint violation exists at enforcement time, the effects of the processing are removed. A currently non-unique count can be used to represent the number of uniqueness-required indexes that are "currently non-unique". The currently non-unique count can be examined to determine whether there are any unresolved uniqueness constraint violations. Constraints can be enforced at the end of the processing of a statement, a transaction, or within a transaction at a savepoint.

US Patent:

61050253, Aug 15, 2000

Filed:

Mar 8, 1996

Appl. No.:

8/612562

Inventors:

Kenneth R. Jacobs - San Mateo CA
Robert J. Jenkins - Foster City CA

Assignee:

Oracle Corporation - Redwood Shores CA

International Classification:

G06F 1730

US Classification:

707 8

Abstract:

The present invention provides a uniqueness-required index and a corresponding non-uniqueness count to support deferred uniqueness constraint enforcement. A uniqueness-required index stores duplicate occurrences of indexed data values that occur during statement or transaction processing. The non-uniqueness count associated with the uniqueness-required index provides a count of the number of indexed data values that occur more than once in the index. Where a non-uniqueness count is not equal to zero, a uniqueness constraint violation remains unresolved. Where an unresolved constraint violation exists at enforcement time, the effects of the processing are removed. A currently non-unique count can be used to represent the number of uniqueness-required indexes that are "currently non-unique". The currently non-unique count can be examined to determine whether there are any unresolved uniqueness constraint violations. Constraints can be enforced at the end of the processing of a statement, a transaction, or within a transaction at a savepoint.