Jakub Kulesza

US Patent:

7756838, Jul 13, 2010

Filed:

Dec 12, 2005

Appl. No.:

11/301168

Inventors:

Jakub Kulesza - Bellevue WA, US
Steven J. Lindell - Bellevue WA, US
Jeffrey A. East - Sammamish WA, US
Luis Felipe - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/00

US Classification:

707682

Abstract:

A method of invalidating an unused log file in a database includes examining a discard log information storage area and determining if a discard log exists. If the discard log exists, the log is invalidated. The headers of each of the log files that have been fully invalidated are then invalidated. The discard log is then fully invalidated and a new log file may be generated on top of the discarded log. The method may be interrupted by a failure, a changeover, or crash and will be repeated until it completes.

US Patent:

8095511, Jan 10, 2012

Filed:

Apr 28, 2004

Appl. No.:

10/833541

Inventors:

Michael J. Zwilling - Redmond WA, US
Gregory A. Smith - Carnation WA, US
Rajeev B. Rajan - Kirkland WA, US
Jakub Kulesza - Bellevue WA, US
Peter Byrne - Bellevue WA, US
Shashikant Brijmohan Khandelwal - Stanford CA, US
Mark S. Wistrom - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707649, 707674, 707683, 707684

Abstract:

The present invention relates to a system and method of data restoration, for instance, after the occurrence of a user error. In particular, snapshot database can be maintained that stores a copy of database data. The snapshot database does not have to store a complete copy of all data on a source database, but rather shares data that is common to both but not necessarily identical. If an error occurs on the primary database then the database can be reverted back to a point in time prior to the error by replacing source database files with snapshot files. Additionally, an undo component can be employed in conjunction with the snapshot to approach an error to a finer grained point in time. In brief, the present invention can restore a database much faster and simpler, while utilizing less space and resources than conventional data restoration technologies.

US Patent:

8301600, Oct 30, 2012

Filed:

Nov 15, 2010

Appl. No.:

12/946524

Inventors:

Michael T. Helmick - Seattle WA, US
Jakub Kulesza - Bellevue WA, US

Assignee:

Amazon Technologies, Inc. - Reno NV

International Classification:

G06F 17/30

US Classification:

707648, 707682

Abstract:

Disclosed are various embodiments for failover recovery in a distributed data store. A computing device determines whether it is a master data store in a distributed data store. New data item updates are assigned the next transaction identifier in a gapless numbering scheme relative to the most durably persisted entry. New data item updates are also associated with a data store identifier that identifies the new master data store.

US Patent:

8473775, Jun 25, 2013

Filed:

Dec 14, 2010

Appl. No.:

12/967187

Inventors:

Michael T. Helmick - Seattle WA, US
Jakub Kulesza - Bellevue WA, US
Timothy A. Rath - Seattle WA, US
Stefano Stefani - Issaquah WA, US
David A. Lutz - Renton WA, US

Assignee:

Amazon Technologies, Inc. - Reno NV

International Classification:

G06F 11/00

US Classification:

714 411, 707623

Abstract:

Disclosed are various embodiments for distributing data items within a plurality of nodes. A data item update request is replicated from a master node in a plurality of nodes to a plurality of slave nodes within the plurality of nodes. The replicated data item update request is determined to be locality-based durable. Responsive to the determination that the replicated data item update request is locality-based durable, the data item update request is confirmed to a client, wherein the client had originated the data item update request. Upon failover of the master node to another node within the plurality of nodes, a fault-tolerant failover quorum ensures that all previously confirmed updates are found and recognized by the new master node.

US Patent:

8521695, Aug 27, 2013

Filed:

Dec 28, 2011

Appl. No.:

13/339077

Inventors:

Michael J. Zwilling - Redmond WA, US
Gregory A. Smith - Carnation WA, US
Rajeev B. Rajan - Kirkland WA, US
Jakub Kulesza - Bellevue WA, US
Peter Byrne - Bellevue WA, US
Shashikant Brijmohan Khandelwal - Standford CA, US
Mark S. Wistrom - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/00

US Classification:

707649, 707745

Abstract:

The present invention relates to a system and method of data restoration, for instance, after the occurrence of a user error. In particular, snapshot database can be maintained that stores a copy of database data. The snapshot database does not have to store a complete copy of all data on a source database, but rather shares data that is common to both but not necessarily identical. If an error occurs on the primary database then the database can be reverted back to a point in time prior to the error by replacing source database files with snapshot files. Additionally, an undo component can be employed in conjunction with the snapshot to approach an error to a finer grained point in time. In brief, the present invention can restore a database much faster and simpler, while utilizing less space and resources than conventional data restoration technologies.

US Patent:

8572091, Oct 29, 2013

Filed:

Jun 27, 2011

Appl. No.:

13/169990

Inventors:

Swaminathan Sivasubramanian - Seattle WA, US
Stefano Stefani - Issaquah WA, US
Chiranjeeb Buragohain - Seattle WA, US
Rande A. Blackman - Seattle WA, US
Timothy Andrew Rath - Seattle WA, US
Grant A. M. McAlister - Seattle WA, US
Jakub Kulesza - Bellevue WA, US
Wei Xiao - Kirkland WA, US
Raymond S. Bradford - Seattle WA, US

Assignee:

Amazon Technologies, Inc. - Reno NV

International Classification:

G06F 17/00
G06F 17/30

US Classification:

707747, 707968, 707972

Abstract:

A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of service clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. The system may provide an API through which clients can query tables maintained by the service. Items may be partitioned and indexed in a table according to a simple or composite primary key contained in all items in the table. A composite primary key may include a hash key attribute, and a range key attribute. The range key attribute may be usable to order items having the same hash key attribute value, and to partition them dependent on a range of range key attribute values. A query request may specify a logical or mathematical expression dependent on range key attribute values and may be directed to multiple partitions.

US Patent:

8595267, Nov 26, 2013

Filed:

Jun 27, 2011

Appl. No.:

13/170031

Inventors:

Swaminathan Sivasubramanian - Seattle WA, US
Stefano Stefani - Issaquah WA, US
Chiranjeeb Buragohain - Seattle WA, US
Rande A. Blackman - Seattle WA, US
Timothy Andrew Rath - Seattle WA, US
Grant A. M. McAlister - Seattle WA, US
Jakub Kulesza - Bellevue WA, US
James Hamilton - Seattle WA, US
Raymond S. Bradford - Seattle WA, US
Luis Felipe Cabrera - Bellevue WA, US

Assignee:

Amazon Technologies, Inc. - Reno NV

International Classification:

G06F 7/00
G06F 17/30
G06F 9/50
G06F 12/08

US Classification:

707803, 707809, 707968, 707972

Abstract:

A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.

US Patent:

20070038682, Feb 15, 2007

Filed:

Aug 15, 2005

Appl. No.:

11/204593

Inventors:

Jakub Kulesza - Bellevue WA, US
Rajeev Rajan - Kirkland WA, US
Steven Schmidt - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707202000

Abstract:

A set of servers takes advantage of the existing data redundancy of a mirrored database to restore page corruptions. The page restore may occur with none of the time and/or administration costs of a restore from backup media and without the data loss associated with repair. Online page restore from a database mirror can be initiated and performed by the computer system automatically upon corruption detection. An entire file or database instead of an individual page or set(s) of pages can be restored. The mechanism can be used both to restore corrupt pages on the principal server from a mirror, or corrupt pages on a mirror from the principal server. Online page restore from a database mirror enables page data recovery without the need to find/load/scan through and apply data and log backups, allowing efficient and potentially automatic data recovery.