中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

15 records (took 0.022 seconds)

    Cosharding and Randomized Cosharding
    1.
    发明公开
    Cosharding and Randomized Cosharding 审中-公开

    公开(公告)号：US20240037085A1

    公开(公告)日：2024-02-01

    申请号：US18376255

    申请日：2023-10-03

    Applicant: Google LLC

    Inventor： Alexander Khesin ,  Alexander Lloyd ,  Sebastian Kanthak

    IPC: G06F16/22 ,  G06F16/27 ,  G06F16/2458

    CPC classification number: G06F16/2282 ,  G06F16/27 ,  G06F16/2477

    Abstract: The technology relates to cosharding tables within a distributed storage system. A data table including one or more rows may be received. Each row in the data table may include an identifier key and pics of data. Each piece of data in the data table may be indexed into individual rows of an index table, wherein each row in the index table includes data associated with the identifier key of the data table from which the piece of data in the respective row was indexed. The index table may be sharded into splits, wherein the sharding includes assigning each row of the index table into one of the splits based on the identifier key of the data table from which the piece of data in the respective row was indexed. The splits may be more stored into two or more or more portions of the distributed storage system.

    Reducing Commit Wait In a Distributed Multiversion Database By Reading The Clock Earlier
    3.
    发明申请
    Reducing Commit Wait In a Distributed Multiversion Database By Reading The Clock Earlier 审中-公开

    公开(公告)号：US20200301729A1

    公开(公告)日：2020-09-24

    申请号：US16895132

    申请日：2020-06-08

    Applicant: Google LLC

    Inventor： Brian Frank Cooper ,  Alexander Lloyd ,  Sebastian Kanthak ,  Andrew Fikes ,  Christopher Taylor

    IPC: G06F9/46 ,  G06F9/52 ,  G06F16/23

    Abstract: 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.

    Cosharding and randomized cosharding
    4.
    发明授权
    Cosharding and randomized cosharding 有权

    公开(公告)号：US11816086B2

    公开(公告)日：2023-11-14

    申请号：US18069519

    申请日：2022-12-21

    Applicant: Google LLC

    Inventor： Alexander Khesin ,  Alexander Lloyd ,  Sebastian Kanthak

    IPC: G06F16/22 ,  G06F16/27 ,  G06F16/2458

    CPC classification number: G06F16/2282 ,  G06F16/2477 ,  G06F16/27

    Abstract: The technology relates to cosharding tables within a distributed storage system. A data table including one or more rows may be received. Each row in the data table may include an identifier key and pieces of data. Each piece of data in the data table may be indexed into individual rows of an index table, wherein each row in the index table includes data associated with the identifier key of the data table from which the piece of data in the respective row was indexed. The index table may be sharded into splits, wherein the sharding includes assigning each row of the index table into one of the splits based on the identifier key of the data table from which the piece of data in the respective row was indexed. The splits may be stored into two or more portions of the distributed storage system.

    Cosharding and Randomized Cosharding
    5.
    发明公开
    Cosharding and Randomized Cosharding 审中-公开

    公开(公告)号：US20230214374A1

    公开(公告)日：2023-07-06

    申请号：US18069519

    申请日：2022-12-21

    Applicant: Google LLC

    Inventor： Alexander Khesin ,  Alexander Lloyd ,  Sebastian Kanthak

    IPC: G06F16/22 ,  G06F16/27

    CPC classification number: G06F16/2282 ,  G06F16/27

    Abstract: The technology relates to cosharding tables within a distributed storage system. A data table including one or more rows may be received. Each row in the data table may include an identifier key and pieces of data. Each piece of data in the data table may be indexed into individual rows of an index table, wherein each row in the index table includes data associated with the identifier key of the data table from which the piece of data in the respective row was indexed. The index table may be sharded into splits, wherein the sharding includes assigning each row of the index table into one of the splits based on the identifier key of the data table from which the piece of data in the respective row was indexed. The splits may be stored into two or more portions of the distributed storage system.

    Cosharding and randomized cosharding
    6.
    发明授权
    Cosharding and randomized cosharding 有权

    公开(公告)号：US11561953B2

    公开(公告)日：2023-01-24

    申请号：US17296441

    申请日：2020-03-18

    Applicant: Google LLC

    Inventor： Alexander Khesin ,  Alexander Lloyd ,  Sebastian Kanthak

    IPC: G06F16/22 ,  G06F16/27 ,  G06F16/2458

    Abstract: The technology relates to cosharding tables within a distributed storage system. A data table including one or more rows may be received. Each row in the data table may include an identifier key and pieces of data. Each piece of data in the data table may be indexed into individual rows of an index table, wherein each row in the index table includes data associated with the identifier key of the data table from which the piece of data in the respective row was indexed. The index table may be sharded into splits, wherein the sharding includes assigning each row of the index table into one of the splits based on the identifier key of the data table from which the piece of data in the respective row was indexed. The splits may be stored into two or more portions of the distributed storage system.

    System and method for sending proposals within a distributed state machine replication system
    8.
    发明授权
    System and method for sending proposals within a distributed state machine replication system 有权

    公开(公告)号：US10462218B1

    公开(公告)日：2019-10-29

    申请号：US14799891

    申请日：2015-07-15

    Applicant: Google LLC

    Inventor： Iulian Moraru ,  Brian Frank Cooper ,  Sebastian Kanthak ,  Alexander Lloyd ,  Mert Akdere

    IPC: H04L29/08 ,  H04L29/06 ,  H04W28/06

    Abstract: Systems and methods are provided for efficiently sending large units of data in a network. A sender computing device splits the proposal into a plurality of fragments, and sends each of the plurality of fragments to a receiver computing device. The sender computing device receives an acknowledgement from the receiver computing device for each fragment received by the receiver computing device. If no acknowledgements for any fragments are received within a predetermined time period, it may be determined that an error occurred, in which case the sender may time out or take another action. The sender computing device further sends a message to the receiver computing device, wherein a payload of the message includes one or more references corresponding to the plurality of fragments sent.

    Including transactional commit timestamps in the primary keys of relational databases
    9.
    发明授权
    Including transactional commit timestamps in the primary keys of relational databases 有权

    公开(公告)号：US11899649B2

    公开(公告)日：2024-02-13

    申请号：US17941455

    申请日：2022-09-09

    Applicant: Google LLC

    Inventor： Sebastian Kanthak ,  Brian Frank Cooper

    IPC: G06F17/30 ,  G06F16/23 ,  G06F16/22 ,  G06F16/28

    CPC classification number: G06F16/2322 ,  G06F16/221 ,  G06F16/2358 ,  G06F16/2365 ,  G06F16/284

    Abstract: In a distributed database, a transaction is to be committed at a first coordinator server and one or more participant servers 1210. The first coordinator server is configured to receive a notification that each participant server of the transaction is prepared at a respective prepared timestamp, the respective prepared timestamp being chosen within a time range for which the respective participant server obtained at least one lock 1220. The first coordinator server computes the commit timestamp for the transaction equal or greater than each of the prepared timestamps 1230, and restrict the commit timestamp such that a second coordinator server sharing at least one of the participant servers for one or more other transactions at a shared shard cannot select the same commit timestamp for any of the other transactions 1240. The transaction is committed at the commit timestamp 1250.

Patent Agency Ranking