Cosharding and randomized cosharding
A shard and distributed storage technology, applied in the field of common sharding of tables, can solve problems such as reducing the efficiency of relational databases
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0033] overview
[0034] This technique generally involves sharding (ie, splitting) an index table such that entries are stored in shards based on the keys of another table, and maintaining these co-sharded indexes in a relational online database in a transactional manner. Maintaining an index transactionally in a relational online database can include: for each new row of data added to the storage system, atomically (transactionally) index the row using the operation of adding a document such that the row and index can become visible to queries when a transaction completes. As the amount of data increases, the distributed storage system can store data from the data table into an index table that indexes data from rows in the data table to individual keys in the index table. Each row in an index table can include a key and data that maps that key back to the row in the data table from which it was indexed. An index table can be sharded by row into multiple shards based on th...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


