Foster D Hinshaw

7010521, Mar 7, 2006

May 13, 2002

10/145571

Foster D. Hinshaw - Somerville MA, US
John K. Metzger - Westborough MA, US
Barry M. Zane - Wayland MA, US

Netezza Corporation - Framingham MA

G06F 17/30

707 3, 707 2

A system from processing database queries allows for cost and locale based distribution for execution of database queries. The database queries are executed on execution engines that provide flexible configuration and overlapping functionality. The system reduces various costs, including elapsed time, required to perform database queries. The system provides processing of a database query using a database catalog comprising database table locality information, record locality information and execution engine information. A query optimizer receives the query and accesses the database catalog to create a query execution plan comprising locality-based database operations. A central database operation processor providing a first execution engine executes the query execution plan by performing at least a portion of the locality-based database operations and distributing at least a portion of the locality-based database operations as a subplan. A second database operation processor providing a second execution engine executes the subplan received from the central database operation processor. At least one of the database operations can be executed on either the first execution engine or the second execution engine.

7089253, Aug 8, 2006

Sep 2, 2003

10/653455

Foster D. Hinshaw - Somerville MA, US
Craig S. Harris - Acton MA, US
Sunil K. Sarin - Newton MA, US

Netezza Corporation - Framingham MA

G06F 17/30

707101, 104 3

A mechanism controls concurrency among database transactions through the use of serial ordering relations. The ordering relations are computed dynamically in response to patterns of use. An embodiment of the present invention serializes a transaction that accesses a resource before a transaction that modifies the resource, even if the accessor starts after the modifier starts or commits after the modifier commits. A method of concurrency control for a database transaction in a distributed database system stores an intended use of a database system resource by the database transaction in a serialization graph. A serialization ordering is asserted between the database transaction and other database transactions based on the intended use of the database system resource by the database transaction. The serialization ordering is then communicated to a node in the distributed database system that needs to know the serialization ordering to perform concurrency control. Cycles in the serialization graph are detected based on the asserted serialization order and in order to break such cycles and ensure transaction serializability a database transaction is identified that is a member of a cycle in the serialization graph.

7089448, Aug 8, 2006

Sep 18, 2003

10/667127

Foster D. Hinshaw - Somerville MA, US
Vincent F. Femia - Northboro MA, US
Craig S. Harris - Acton MA, US
John K. Metzger - Westborough MA, US
David L. Meyers - Shrewsbury MA, US
Barry M. Zane - Wayland MA, US

Netezza Corporation - Framingham MA

G06F 11/16

714 6, 714 5, 714 7, 714 8, 714 42, 711114

A disk is segmented into a first data segment and a secondary data segment. The secondary data segment stores a logical mirror of the first data segment of another disk. Fast access to data stored on the disk is provided by partitioning the disk such that the first data segment includes the fast tracks of the disk and the secondary data segment includes the slow tracks of the disk and forwarding all data requests to the first data segment. Upon detecting a failure, the logical mirror of data stored in the first data segment of the failed disk is accessible from the secondary data segment of a non-failed disk. The first data segment can be rebuilt quickly on another disk from the logical mirror stored in the secondary data segment.

7146366, Dec 5, 2006

Sep 2, 2003

10/653453

Foster D. Hinshaw - Somerville MA, US
Craig S. Harris - Acton MA, US
Sunil K. Sarin - Newton MA, US

Netezza Corporation - Framingham MA

G06F 17/30

707 8, 707 10

A mechanism controls concurrency among database transactions through the use of serial ordering relations. The ordering relations are computed dynamically in response to patterns of use. An embodiment of the present invention serializes a transaction that accesses a resource before a transaction that modifies the resource, even if the accessor starts after the modifier starts or commits after the modifier commits. A method of concurrency control for a database transaction in a distributed database system stores an intended use of a database system resource by the database transaction in a serialization graph. A serialization ordering is asserted between the database transaction and other database transactions based on the intended use of the database system resource by the database transaction. The serialization ordering is then communicated to a node in the distributed database system that needs to know the serialization ordering to perform concurrency control. Cycles in the serialization graph are detected based on the asserted serialization order and in order to break such cycles and ensure transaction serializability a database transaction is identified that is a member of a cycle in the serialization graph.

7272605, Sep 18, 2007

May 13, 2002

10/145564

Foster D. Hinshaw - Somerville MA, US
Steven T. Almy - Westborough MA, US
David A. Utter - Princeton MA, US
Barry M. Zane - Wayland MA, US

Netezza Corporation - Framingham MA

G06F 17/30
G06F 15/16
G06F 15/173

707 10, 707102, 709203, 709225, 709226, 709227

A database appliance having multiple internetworked data storage units and central database processing units. The central database processors and storage units communicate as network nodes. Execution of a distributed database application is coordinated by a communication process such that data blocks are passed by using data block reference information. Operations executing within the same context as the communication process may include join, sort, aggregate, restrict, reject, expression evaluation, statistical analysis or other database operations.

7305386, Dec 4, 2007

Aug 22, 2003

10/646522

Foster D. Hinshaw - Somerville MA, US
Craig S. Harris - Acton MA, US
Sunil K. Sarin - Newton MA, US

Netezza Corporation - Framingham MA

G06F 17/30
G06F 7/00

707 4, 707 10, 707203, 707102

A multi-version database system controls visibility of data during transaction processing. A transaction includes a transaction identifier that identifies the transaction and an invisibility list of transactions whose effects are invisible to the transaction. Changes made by other transactions are visible to the transaction based on the isolation level of the transaction. Records are visible to a transaction based on a creator identifier stored in the record that identifies the transaction that created the record.

7337351, Feb 26, 2008

Jul 6, 2004

10/885519

Barry M. Zane - Wayland MA, US
Foster D. Hinshaw - Somerville MA, US
Philip J. MacDonald - Waltham MA, US
John K. Metzger - Westborough MA, US

Netezza Corporation - Framingham MA

G06F 11/00

714 6

A disk is segmented into a first data segment and a secondary data segment. The secondary data segment stores a logical mirror of the first data segment of another disk. Upon detecting a failure, the logical mirror of data stored in the first data segment of the failed disk is accessible from the secondary data segment of a non-failed disk. The first data segment can be rebuilt quickly on another disk from the logical mirror stored in the secondary data segment. During regenerating, accesses to the first data segment on the disk containing the logical mirror are handled by its own logical mirror, which is not involved in the regenerating process.

7430549, Sep 30, 2008

Jul 7, 2004

10/886011

Barry M. Zane - Wayland MA, US
James P. Ballard - Northbridge MA, US
Foster D. Hinshaw - Somerville MA, US
Dana A. Kirkpatrick - Northborough MA, US
Premanand Yerabothu - Southborough MA, US

Netezza Corporaton - Framingham MA

G06F 17/30

707 3, 707 4, 707 5

This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. The present invention provides a method for generating executable machine code for query execution plans, that is adaptive to dynamic runtime conditions, that is compiled just in time for execution and most importantly, that avoids the bounds checking, pointer indirection, materialization and other similar kinds of overhead that are typical in interpretive runtime execution engines.