Cobra: verifying serializability of black-box databases
5
Starting point: brute-force search on a polygraph
6
Outline
7
Checking serializability may be tractable in practice
8
Cobra aims at real-world workloads
9
How to reduce constraints in a polygraph?
10
Combining writes exploits a common pattern
11
Combining writes: exploit common patterns
12
Cobra exploits characteristics of the problem
13
Pruning via graph paths (reachability)
14
Cobra verifies in rounds to support growing histories
15
Experimental evaluation
16
Experiment setup
17
Cobra can handle 10x larger workloads
18
Decomposition of Cobra's verification runtime
19
Recap
20
Related work
21
Summary
Description:
Explore a conference talk that delves into Cobra, a groundbreaking system designed to verify serializability in transactional key-value stores. Learn how this innovative approach combines black-box checking and scalability for real-world online transactional processing workloads. Discover the technical challenges faced in addressing the computationally expensive search problem and the novel techniques employed, including a new encoding of the validity condition, hardware acceleration for input pruning, and a transaction segmentation mechanism. Gain insights into Cobra's performance improvements, its ability to handle high transaction volumes, and its support for continuous verification. Understand the importance of serializability in cloud databases and how Cobra provides clients with assurance about database correctness in cloud environments.
Cobra - Making Transactional Key-Value Stores Verifiably Serializable