Sebastian Kanthak

20130346540, Dec 26, 2013

May 21, 2013

13/899495

Sanjay Ghemawat - Mountain View CA, US
Yasushi Saito - Mountain View CA, US
Andrew Fikes - Los Altos CA, US
Christopher Jorgen Taylor - Palo Alto CA, US
Sean Quinlan - Palo Alto CA, US
Michal Piotr Szymaniak - Mountain View CA, US
Sebastian Kanthak - San Jose CA, US
Wilson Cheng-Yi Hsieh - Syosset NY, US
Alexander Lloyd - New York NY, US
Michael James Boyer Epstein - Brooklyn NY, US

Google Inc. - Mountain View CA

H04L 29/08

709214

A system, computer-readable storage medium storing at least one program, and a computer-implemented method for identifying a storage group in a distributed storage system into which data is to be stored is presented. A data structure including information relating to storage groups in a distributed storage system is maintained, where a respective entry in the data structure for a respective storage group includes placement metrics for the respective storage group. A request to identify a storage group into which data is to be stored is received from a computer system. The data structure is used to determine an identifier for a storage group whose placement metrics satisfy a selection criterion. The identifier for the storage group whose placement metrics satisfy the selection criterion is returned to the computer system.

20130339295, Dec 19, 2013

May 20, 2013

13/898411

Jeffrey Adgate Dean - Palo Alto CA, US
Michael James Boyer Epstein - Brooklyn NY, US
Andrew Fikes - Los Altos CA, US
Sanjay Ghemawat - Mountain View CA, US
Wilson Cheng-Yi Hsieh - Syosset NY, US
Alexander Lloyd - New York NY, US
Yasushi Saito - Mountain View CA, US
Michal Piotr Szymaniak - Mountain View CA, US
Sebastian Kanthak - San Jose CA, US
Chris Jorgen Taylor - Palo Alto CA, US

Google, Inc. - Mountain View CA

G06F 17/30

707610

A distributed storage system is provided. The distributed storage system includes multiple front-end servers and zones for managing data for clients. Data within the distributed storage system is associated with a plurality of accounts and divided into a plurality of groups, each group including a plurality of splits, each split being associated with a respective account, and each group having multiple tablets and each tablet managed by a respective tablet server of the distributed storage system. Data associated with different accounts may be replicated within the distributed storage system using different data replication policies. There is no limit to the amount of data for an account by adding new splits to the distributed storage system. In response to a client request for a particular account's data, a front-end server communicates such request to a particular zone that has the client-requested data and returns the client-requested data to the requesting client.

20130339301, Dec 19, 2013

Jun 3, 2013

13/909029

Sanjay Ghemawat - Mountain View CA, US
Sebastian Kanthak - San Jose CA, US
Christopher Cunningham Frost - Sunnyvale CA, US

Google Inc. - Mountain View CA

G06F 17/30

707649

A computer system issues a batch read operation to a tablet in a first replication group in a distributed database and obtains a most recent version of data items in the tablet that have a timestamp no great than a snapshot timestamp T. For each data item in the one tablet, the computer system determines whether the data item has a move-in timestamp less than or equal to the snapshot timestamp T, which is less than a move-out timestamp, and whether the data item has a creation timestamp less than the snapshot timestamp T, which is less than or equal to a deletion timestamp. If the determination is true, the computer system determines whether the move-out timestamp has an actual associated value and, if so, the computer system determines a second tablet in a second replication group in the database that includes the data item and issues the snapshot read operation to the second table in the second replication group to obtain a most-recent version of the data item that has a timestamp no greater than the snapshot timestamp T; otherwise, the computer system issues the snapshot read to the one tablet to obtain a most recent version of the data item that has a timestamp no greater than the snapshot timestamp T.

20230052324, Feb 16, 2023

Nov 3, 2022

17/980268

- Mountain View CA, US
Brian Frank Cooper - Los Altos CA, US
Sebastian Kanthak - Los Altos CA, US
Alexander Lloyd - New York NY, US
Mert Akdere - Mountain View CA, US

H04L 67/133
H04L 67/60
H04L 67/1074
H04L 69/324
H04W 28/06
H04L 69/28

Systems and methods are provided for sending and receiving remote procedure calls (RPCs). Based on a message in a first RPC, a second set of RPCs are created by one or more computing devices, where each of the second set of RPCs includes a portion of the message in the first RPC. The message in the first RPC is replaced with a reference to each RPC of the second set of RPCs. The one or more computing devices send the first RPC with the references, and also send the second set of RPCs.

20200301729, Sep 24, 2020

Jun 8, 2020

16/895132

- Mountain View CA, US
Alexander Lloyd - New York NY, US
Sebastian Kanthak - Los Altos CA, US
Andrew Fikes - Los Altos CA, US
Christopher Taylor - Palo Alto CA, US

G06F 9/46
G06F 9/52
G06F 16/23

In a distributed system where a client's call to commit a transaction occurs outside the transaction's lock-hold interval, computation of timestamp information for the transaction is moved to a client library, while ensuring that no conflicting reads or writes are performed between a time of the computation and acquiring all locks for the transaction. The transaction is committed in phases, with each phase being initiated by the client library. Timestamp information is added to the locks to ensure that timestamps are generated during lock-hold intervals. An increased number of network messages is thereby overlapped with a commit wait period in which a write in a distributed database is delayed in time to ensure concurrency in the database.

20180329739, Nov 15, 2018

Jul 14, 2017

15/649920

- Mountain View CA, US
Alexander Lloyd - New York NY, US
Sebastian Kanthak - San Jose CA, US
Andrew Fikes - Los Altos CA, US
Christopher Taylor - Palo Alto CA, US

G06F 9/46
G06F 9/52

In a distributed system where a client's call to commit a transaction occurs outside the transaction's lock-hold interval, computation of timestamp information for the transaction is moved to a client library, while ensuring that no conflicting reads or writes are performed between a time of the computation and acquiring all locks for the transaction. The transaction is committed in phases, with each phase being initiated by the client library. Timestamp information is added to the locks to ensure that timestamps are generated during lock-hold intervals. An increased number of network messages is thereby overlapped with a commit wait period in which a write in a distributed database is delayed in time to ensure concurrency in the database.