5.6 KiB
Datastores
-
Calvin: Fast Distributed Transactions for Partitioned Database Systems
-
Consistency Tradeoffs in Modern Distributed Database System Design
-
CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data
-
Don’t Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS
-
HaLoop: Efficient Iterative Data Processing on Large Clusters
-
Making Reliable Distributed Systems in the Presence of Software Errors
-
Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System
-
Map-Reduce-Merge: Simplified Relational Data Processing on Large Clusters
-
Towards a Next Generation Data Center Architecture: Scalability and Commoditization
-
GenDB: The Next Generation of Query Processing -- Synthesized, Not Engineered (2026) by Jiale Lao and Immanuel Trummer
GenDB uses an LLM-powered agent to synthesize query execution code tailored to particular data, workloads, and hardware, making the case for query processing that is generated rather than maintained as a general-purpose engine.
-
Bespoke OLAP: Synthesizing Workload-Specific One-size-fits-one Database Engines (2026) by Johannes Wehrstein, Timo Eckmann, Matthias Jasny, and Carsten Binnig
This paper presents an autonomous pipeline that synthesizes a database engine for a fixed OLAP workload, using iterative performance evaluation and validation to turn LLM code generation into a high-performance system-building process.
Hosted Papers
-
📜 Bigtable: A Distributed Storage System for Structured Data
-
📜 Elle: Inferring Isolation Anomalies from Experimental Observations
-
📜 Freenet: A Distributed Anonymous Information Storage and Retrieval System
-
📜 Megastore: Providing Scalable, Highly Available Storage for Interactive Services
-
📜 RADOS: A Scalable, Reliable Storage Service for Petabyte-scale Storage Clusters
-
📜 TAO: Facebooks Distributed Data Store for the Social Graph'