18376255. Cosharding and Randomized Cosharding simplified abstract (GOOGLE LLC)
Contents
Cosharding and Randomized Cosharding
Organization Name
Inventor(s)
Alexander Khesin of Hoboken NJ (US)
Alexander Lloyd of New York NY (US)
Sebastian Kanthak of Los Altos CA (US)
Cosharding and Randomized Cosharding - A simplified explanation of the abstract
This abstract first appeared for US patent application 18376255 titled 'Cosharding and Randomized Cosharding
Simplified Explanation
The technology described in this patent application is related to cosharding tables within a distributed storage system. It involves receiving a data table with one or more rows, where each row includes an identifier key and pieces of data. The data in the data table is indexed into individual rows of an index table, where each row in the index table includes data associated with the identifier key of the data table from which the data was indexed. The index table is then sharded into splits, with each row of the index table being assigned to a split based on the identifier key of the data table. These splits are stored in different portions of the distributed storage system.
- The technology involves cosharding tables within a distributed storage system.
- Data tables with identifier keys and pieces of data are received.
- The data in the data table is indexed into individual rows of an index table.
- Each row in the index table includes data associated with the identifier key of the data table.
- The index table is sharded into splits based on the identifier key.
- The splits are stored in different portions of the distributed storage system.
Potential Applications
- This technology can be applied in large-scale distributed databases where efficient storage and retrieval of data is crucial.
- It can be used in systems that require high availability and fault tolerance, as the data is distributed across multiple portions of the storage system.
Problems Solved
- The technology solves the problem of efficiently indexing and storing data in a distributed storage system.
- It addresses the challenge of sharding and distributing data across multiple portions of the storage system based on identifier keys.
Benefits
- The technology allows for efficient storage and retrieval of data in a distributed storage system.
- It improves scalability and performance by distributing data across multiple portions of the storage system.
- The cosharding approach provides fault tolerance and high availability, as data is replicated across different splits.
Original Abstract Submitted
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.
