. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . from one operator becomes the input for the next operator. Operators that join two branches in the tree combine input from two incoming streams and produce a single output. Evaluation of the execution plan range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . from one operator becomes the input for the next operator. Operators that join two branches in the tree combine input from two incoming streams and produce a single output. Evaluation of the execution plan range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . from one operator becomes the input for the next operator. Operators that join two branches in the tree combine input from two incoming streams and produce a single output. Evaluation of the execution plan range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . from one operator becomes the input for the next operator. Operators that join two branches in the tree combine input from two incoming streams and produce a single output. Evaluation of the execution plan range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . from one operator becomes the input for the next operator. Operators that join two branches in the tree combine input from two incoming streams and produce a single output. Evaluation of the execution plan range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . from one operator becomes the input for the next operator. Operators that join two branches in the tree combine input from two incoming streams and produce a single output. Evaluation of the execution plan range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move page and click Watch. Approving a Pull Request As a reviewer you can approve a pull request through two ways: • Approve the pull request via GitHub’s code review system • Reply with a comment that contains

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 Two-Phase Commit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . range of keyspace IDs. Using this technique means you can split a given shard by replacing it with two or more new shards that combine to cover the original range of keyspace IDs, without having to move page and click Watch. Approving a Pull Request As a reviewer you can approve a pull request through two ways: • Approve the pull request via GitHub’s code review system • Reply with a comment that contains

posture of Vitess from different perspectives, they also offered a level of synergy; Ada Logics found two CVEʼs during the audit which the threat model goal helped to assess. The threat model was also a force-multiplier force-multiplier for the fuzzing work that led to the discovery of a few missed edge cases when fixing the two CVEʼs. The audit started with a meeting between Ada Logics, the Vitess maintainers and OSTIF. A�er “ADA-VIT-SA23-12, VTAdmin users that can create shards can deny access to other functions”. These two issues allowed a malicious user to create a resource that would then subsequently disallow other operations

read-only downtime Vitess Resharding • shard0, shard1, origin master —> vttablet • prepare two spare shard0, shard1 • vtgate point to origin master • multi-snapshot : data & repl-pos • multi-restore