WeaklyDB.

WeaklyDB

An experimental distributed database

A research-oriented implementation and study environment for examining the consequences of replication, weak consistency, and coordination in distributed key–value storage.

Project status: Experimental. The current website describes a research direction, not a peer-reviewed result, completed implementation, or established consistency guarantee.
01

Abstract

WeaklyDB is an experimental distributed database project intended to support systematic investigation of how replicated storage behaves under asynchronous communication, concurrency, and failures. The central concern is to make a distinction between an intended consistency contract, the executions admitted by a particular protocol, and the behavior observed in a running implementation.

The project is motivated in part by Dynamo [1], which demonstrates a design space for highly available key–value storage in which consistency and availability requirements shape replication and conflict handling. WeaklyDB does not claim to reproduce Dynamo's implementation or inherit its guarantees; the paper serves as a foundational reference for the questions investigated here.

02

Research questions

  1. RQ1
    Consistency specification. What histories are permitted by a chosen replication protocol, and which formal consistency properties do those histories satisfy?
  2. RQ2
    Ordering and convergence. Under which assumptions do concurrent writes lead to a convergent state, and how do update-order and conflict-resolution choices affect that outcome?
  3. RQ3
    Availability and progress. How do message delay, partitions, stale observations, and replica recovery influence safety and liveness?
  4. RQ4
    Evidence and reproducibility. How can counterexamples, executions, and experimental observations be recorded and checked independently?

These are proposed lines of investigation, not claims of novelty or completed findings.

03

System model and assumptions

The precise protocol and fault model are under development. The following is an outline of aspects that should be specified before a system-level guarantee can be asserted.

ProcessesClients and replicas; membership assumptions to be specified.
Shared objectsReplicated key–value records; operation semantics to be specified.
CommunicationDelivery, reordering, and timing assumptions to be specified.
FailuresCrash, partition, and recovery assumptions to be specified.
ConsistencyA formally stated target property, with supporting proof or counterexample, is pending.

Research results should distinguish specification, implementation, and experimental observation. An observed convergent execution alone, for example, does not establish convergence for all admissible executions.

04

Research artifacts

As material becomes available, this page will link to the corresponding versioned artifacts rather than presenting unverified benchmark figures.

  • Formal specifications and invariantsNot published
  • Protocol and implementation documentationIn preparation
  • Test harnesses and execution tracesNot published
  • Evaluation methodology and raw resultsNot published
05

References

[1]

Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. “Dynamo: Amazon's Highly Available Key-value Store.” Proceedings of the 21st ACM Symposium on Operating Systems Principles (SOSP '07), pp. 205–220, 2007.

DOI: 10.1145/1294261.1294281 ↗ · Author-hosted version ↗

Reference [1] motivates the study of available replicated key–value systems; this is not a statement of code lineage, formal equivalence, or adopted implementation details.