Throw Some Keys on it: Data Modeling For Key/Value Data Stores by Example
summary
Models Uber driver presence with a distributed key value store using grid cells as keys and serialized sets as values and demonstrates a working implementation that finds nearest cars by scanning nearby cells and sorting by distance. Uses G-Set CRDT for conflict free membership, stores cells with a namespace-by-timestamp convention, and resolves concurrent writes by sibling merge at read time so reads pay merge cost instead of writes and the example scales under eventual consistency.
AI-written summary · about
chapters (7)
- 0:00Start
- 2:00Extend Existing Schemas
- 2:37Key Value Stores
- 9:38Set Up Location
- 10:11Request Car Function
- 12:16Siblings in React
- 16:10Ruby Api for React
related talks
59mKey-Value Stores in Large Projects
01h 08mDistributed Java Databases Under the Hood
42mDatabases unveiled; choose wisely
27mData Modeling: Master This Critical Step to Adopting a Distributed Database
18mGermany's Next Top Data Model
52mData storage for modern applications - Mike Lehan
52mTaking Storage for a Ride
49mDistributed Data: Conflict-free Data Structures in JS