Kenneth J Ross

Address:

370 Riverside Dr APT 16A, New York, NY 10025

Phone:

(212)7499505

VIN:

WDBTK72F08T089739

Make:

MERCEDES-BENZ

Model:

CLK-CLASS

Year:

2008

US Patent:

6711562, Mar 23, 2004

Filed:

Feb 27, 2002

Appl. No.:

09/600266

Inventors:

Kenneth A. Ross - New York NY
Jun Rao - New York NY

Assignee:

The Trustees of Columbia University in the City of New York - New York NY

International Classification:

G06F 1730

US Classification:

707 3, 707 2, 707200

Abstract:

Cache sensitive search tree (CSS-tree) index structures for providing improved search and lookup performance compared with conventional searching schemes. The CSS-tree index structures include a directory tree structure which is stored in an array ( ) and serves as an index for a sorted array of elements. The nodes ( ) in the directory tree structure may be of sizes selected to correspond to the cache line size in the computer system utilizing the CSS-tree index structures. Child nodes ( ) within the directory tree structure are located by performing arithmetic operations on array offsets. Thus, it is not necessary to store internal child node pointers, thereby reducing memory storage requirements. In addition, the CSS-tree index structures are organized so that traversing each level in the tree yields good data reference locality, and therefore relatively few cache misses. Thus, the CSS-tree index structures consider cache-related parameters such as reference locality and cache behavior, without requiring substantial additional amounts of memory.

US Patent:

6889358, May 3, 2005

Filed:

Jan 8, 1998

Appl. No.:

09/004265

Inventors:

Daniel Francis Lieuwen - Plainfield NJ, US
Akira Kawaguchi - New York NY, US
Inderpal Singh Mumick - Berkeley Heights NJ, US
Dallan Wendell Quass - Palo Alto CA, US
Kenneth A. Ross - New York NY, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G06F015/00
G06F007/00
G06F017/30
G06F017/21

US Classification:

715500, 707 1, 707 2, 707 8, 707 9, 707202, 707203

Abstract:

In a database, a database manager can generate a view, which, in concept, is a subset of the database, which is placed outside the database for use without disturbing the database, and without disturbance by others using the database. The subset, or view, can be understood as a collection of rows, or tuples, of data copied from the database. With views existing, multiple copies of data within the database now exist: the original in the database, and copies in the views. If one of these is changed, without corresponding changes made in the others, then inconsistencies occur, which cannot be tolerated. Under the invention, when a user seeks a lock on a view, indicating that a change may be imminent, the invention locks a superset of the tuples in the database from which the view is derived. A superset is a set which contains the set of tuples of the view, plus possibly others. Thus, more tuples are locked than strictly necessary.

US Patent:

7424591, Sep 9, 2008

Filed:

Jun 19, 2006

Appl. No.:

11/455339

Inventors:

Kenneth Andrew Ross - New York NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/02

US Classification:

711170, 711216

Abstract:

A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.

US Patent:

7752414, Jul 6, 2010

Filed:

Jul 3, 2008

Appl. No.:

12/167773

Inventors:

Kenneth Andrew Ross - New York NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/02

US Classification:

711170, 711216

Abstract:

A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.

US Patent:

7752418, Jul 6, 2010

Filed:

Jun 9, 2008

Appl. No.:

12/136017

Inventors:

Kenneth Andrew Ross - New York NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/00

US Classification:

711216, 711108, 711164

Abstract:

A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one of the plurality of hash functions. The data item and a key portion and a payload portion of all data items are stored contiguously within the memory location. Also provided for are retrieving data items in a computer. A plurality of hash functions of data values in a probe key are computed. A corresponding memory location is determined for each of the plurality of hash functions. Data items in each memory location are examined to determine a match with the probe key. Responsive to a match, a payload of the matching stored data item is returned. All of the steps are performed free of conditional branch instructions.

US Patent:

8065304, Nov 22, 2011

Filed:

Jun 11, 2008

Appl. No.:

12/137133

Inventors:

Kenneth Andrew Ross - New York NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707737, 707739, 707752, 707824, 711103, 711104, 711105

Abstract:

In one illustrative embodiment, a computer implemented method using asymmetric memory management is provided. The computer implemented method receives a request, containing a search key, to access an array of records in the asymmetric memory, wherein the array has a sorted prefix portion and an unsorted append portion, the append portion alternatively comprising a linked-list, and responsive to a determination that the request is an insert request, inserts the record in the request in arrival order in the unsorted append portion to form a newly inserted record. Responsive to a determination that the newly inserted record completes the group of records, stores an index, in sorted order, for the group of records.

US Patent:

8161241, Apr 17, 2012

Filed:

Jan 12, 2010

Appl. No.:

12/686022

Inventors:

Bishwaranjan Bhattacharjee - Hawthorne NY, US
Mustafa Canim - Dallas TX, US
Christian A. Lang - Hawthorne NY, US
George A. Mihaila - Hawthorne NY, US
Kenneth A. Ross - Hawthorne NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/08

US Classification:

711118, 711112, 711135

Abstract:

A system and method for managing a cache includes monitoring a temperature of regions on a secondary storage based on a cumulative cost to access pages from each region of the secondary storage. Similar temperature pages are grouped in logical blocks. Data is written to a cache in a logical block granularity by overwriting cooler blocks with hotter blocks.

US Patent:

20040172400, Sep 2, 2004

Filed:

Jan 20, 2004

Appl. No.:

10/483409

Inventors:

Rony Zarom - New York NY, US
Kenneth Ross - New York NY, US
Kenneth Yip - Elmhurst NY, US

International Classification:

G06F017/00

US Classification:

707/100000

Abstract:

A system and method for employing associative memory for the storing the data of a relational database. The system and method of the present invention optionally include additional hardware components in order for the Associative memory to be usable for the relational database, as CAM (content associated memory).