database_internals

chinese translation of database internals, now the progress is

• Part 2 - Distributed Systems
  • Chapter 8 - Introduction and Overview
    • Concurrent Execution
    • Fallacies of Distributed Conputing
    • Distributed Systems Abstractions
    • Two Generals' Problem
    • System Synchrony
    • Failure Models
  • Chapter 9 - Failure Detection
    • Hearbeats and Pings
    • Phi-Accural Failure Detector
    • Gossip and Failure Dectection
    • Reversing Failure Detection Problem Statement
    • Summary
  • Chapter 10 - Leader Election
    • Bully Algorithm
    • Next-in-Line Failover
    • Candidate/Ordinary Optimization
    • Invitation Algorithm
    • Ring Algorithm
    • Summary
  • Chapter 11 - Replication and Consistency
    • Archieving Availability
    • Infamous CAP
    • Shared Memory
    • Ordering
    • Consistency Models
    • Session Models
    • Eventual Consistency
    • Tunable Consistency
    • Witness Replicas
    • Strong Eventual Consistency and CRDTs
    • Summary
  • Chapter 12 - Anti-Entropy and Dissemination
  • Chapter 13 - Distributed Transactions
  • Chapter 14 - Consensus
• Part 1 - Storage Engine DONE
  • Chapter 1 - Introduction and Overview
    • DBMS Architecture
    • Memory- Versus Disk-Based DBMS
    • Column- Versus Row-Oriented DBMS
    • Data Files and Index Files
    • Buffering Immutablity and Ordering
    • Summary
  • Chapter 2 - BTree Basics
    • Binary Search Trees
    • Disk Based Structures
    • Ubiquitous B-Trees
  • Chapter 3 - FIle Format
    • Motivation
    • Binary Encoding
    • General Principles
    • Page Structure
    • Slotted Pages
    • Cell Layout
    • Combining Cells into Slotted Pages
    • Managing Variable-Size Data
    • Versioning
    • Checksumming
    • Summary
  • Chapter 4 - Implement B-Trees
    • Page Header
    • Binary Search
    • Propagating Splits and Merges
    • Rebalancing
    • Right-Only Appends
    • Compression
    • Veccum and Maintenance
    • Summary
  • Chapter 5 - Transaction Processing and Recory
    • Buffer Management
    • Recovery
    • Concurrency Control
    • Summary
  • Chapter 6 - B-Tree Variants
    • Copy-on-Write
    • Abstracting Node Updates
    • Lazy B-Trees
    • FD-Trees
    • BW-Trees
    • Cache-Oblivious B-Trees
  • Chapter 7 - Log-Structured Storage
    • LSM Trees
    • Read, Write, and Space Amplification
    • Implemention Details
    • Unordered LSM Storage
    • Concurrency in LSM Trees
    • Log Stacking
    • LLAMA and Mindful Stacking
    • Summary
  • Conclusion