Paul L Sinclair, 721825 John St, Manhattan Beach, CA 90266

6505188, Jan 7, 2003

Jun 15, 2000

09/594963

Ahmad Said Ghazal - Redondo Beach CA
Paul Laurence Sinclair - Manhattan Beach CA
Chi Kim Hoang - Palo Alto CA

NCR Corporation - Dayton OH

G06F 1730

707 2

The retrieval of data from a database in a computerized database management system is optimized through the use of a virtual join index and associated covering non-unique secondary indexes. The virtual join index is created by combining one or more commonly-used columns of one or more tables. The covering non-unique secondary indexes are generating by combining one or more commonly-used columns of the virtual join index. Data is not stored in the virtual join index after the covering non-unique secondary indexes are generated. Thereafter, some queries or portions thereof may be resolved solely by accessing one or more of the covering non-unique secondary indexes.

6643636, Nov 4, 2003

Jun 5, 2001

09/874804

Grace Kwan-On Au - Rancho Palos Verdes CA
Ahmad Said Ghazal - Redondo Beach CA
Paul Laurence Sinclair - Manhattan Beach CA

NCR Corporation - Dayton OH

G06F 1730

707 2

A method, database system and computer program are disclosed for optimizing a SQL query, in which the SQL query includes a WHERE clause and a FROM clause. An evaluation is done to determine whether a non-covering join index partially but not completely covers the query. If it does, the join index is added to the FROM clause of the query without removing the partially covered base tables and the WHERE clause of the query is modified by: (1) mapping a query condition to the join index for its partially covered base tables; and (2) adding a join back condition from the join index to a base table from which the join index was formed.

6662175, Dec 9, 2003

May 8, 2001

09/850765

Ahmad Said Ghazal - Redondo Beach CA
Paul Laurence Sinclair - Manhattan Beach CA

NCR Corporation - Dayton OH

G06F 1730

707 2, 707 10

A method and computer system for optimizing queries to a database are disclosed. The database includes a first table (T ) having a primary key (PK) column and a first correlated value column (CV ) and a second table (T ) having a foreign key (FK) column related to the primary key column of the first table and a second correlated value column (CV ). The method includes joining T to the T using PK=FK as the join condition to produce a join result having rows. Each row includes a value from CV and a value from CV. The method further includes creating an initial running constraint (RC). The initial running constraint includes a null range. The method further includes producing a derived constraint rule (DCR) having the following form: where C and C are constants, and âââ means âimplies,â by performing the following processing for each row in the join result: computing a new constraint (NEW), having a range, and modifying RC by merging the range of NEW with the range of RC.

6738756, May 18, 2004

Jun 30, 2000

09/608977

Douglas P. Brown - Rancho Santa Fe CA
Paul Sinclair - Manhattan Beach CA

NCR Corporation - Dayton OH

G06F 1730

707 2, 707 3, 707 10, 709202, 703 20

A method and apparatus of analyzing a target system comprises receiving information relating to an environment of the target system and storing cost data based on the environment information. The plan and its estimated performance for a query may be determined based on the cost data. The environment information may pertain to the environment of a parallel system (e. g. , a multi-node parallel system, a single-node parallel system having plural central processing units or a system running plural virtual processors) that is running a parallel database. The cost data may identify a number of nodes in the target system, a number of central processing units in each node of the target system, and other types of system information. The cost data may be stored in a relational table having a plurality of rows. Each row of the relational table may correspond to a different target system.

6772163, Aug 3, 2004

Dec 20, 2001

10/029082

Paul Laurence Sinclair - Manhattan Beach CA
Kuorong Chiang - Cerritos CA

NCR Corporation - Dayton OH

G06F 700

707100, 709215, 711153

A method, computer system, and computer program are claimed for selecting rows from first and second tables each having rows containing values in columns. In at least the first table, the rows are divided into partitions at least one of which is populated by one or more rows. The method, computer system, and computer program include (a) defining a subset of the populated partitions of the first table that excludes at least one populated partition of the first table, (b) creating a file context, which stores at least location data for a row and a first value associated with the row, for each populated partition in the subset of the populated partitions of the first table, (c) determining the lowest first value stored by the file contexts for the first table, (d) identifying rows with a particular first value by at least reading the file contexts of the first table, and (e) repeating a through d until the subsets of the populated partitions of the first table have included all the populated partitions of the first table.

6845375, Jan 18, 2005

Oct 20, 2001

09/986229

Paul Laurence Sinclair - Manhattan Beach CA, US

NCR Corporation - Dayton OH

G06F 1700
G06F 1200

707100, 707205, 711153

A database system with multi-level partitioning is disclosed. The system includes a plurality of storage facilities with each storage facility storing data that represents rows of database tables. In each storage facility table rows corresponding to a specific table are logically ordered according to a row identifier, also called the row ID. The row ID includes a first value that is based on one or more columns of the table. The row ID also includes a second value that is based on one or more columns of the table. The row ID also includes a third value. The first value is calculated based on a single-level function. The single-level function is a combination of a plurality of functions. The single-level function produces different values for two rows when any of the plurality of functions produces different values for the two rows. The first value of the row ID is predominate in determining the order of the rows in the storage facilities. The second value determines the order of those rows with identical first values.

6944633, Sep 13, 2005

Dec 10, 2003

10/732393

Lawrence H. Higa - Los Angeles CA, US
Paul L. Sinclair - Manhattan Beach CA, US
Mark William Sirek - San Diego CA, US
Kuorong Chiang - Cerritos CA, US

NCR Corporation - Dayton OH

G06F017/30

7071041, 707100, 707101, 707 3, 707 2

A method of performing a join includes identifying a join that identifies a first table and a second table. The first table includes a plurality of first table rows. Each of the plurality of first table rows are grouped into one of a plurality of first table partitions. The second table includes one or more second table rows. Each of the plurality of second table rows are grouped into one or more second table partitions. A determination is made as to whether the first table and the second table are joined on equality constraints. The one or more first table rows are joined with the one or more second table rows using a rowkey merge join where equality exists.

6999967, Feb 14, 2006

Dec 26, 2001

10/036016

Ahmad Said Ghazal - Redondo Beach CA, US
Paul Laurence Sinclair - Manhattan Beach CA, US

NCR Corp. - Dayton OH

G06F 17/30

707101, 707 3, 707102

A method, computer program and system for joining two tables, tand tare described. Each table contains rows and columns and is divided into one or more partitions. A correlation function is calculated between a first correlated value column of table tand a second correlated value column of table t. Following a query request, a joining algorithm is used to join tand t, using a reduced set of partitions based in part upon the correlation function.