SRFI-167, SRFI-168 and the functional store
summary
Describes an implementation of SRFI-167/168 as an ordered key-value ranges store supporting range scans, prefix matching and lexicographic packing; shows a prototype that handles data larger than memory by storing shards on disk and running ACID transactions across branches. Demonstrates versioned branches with merge and time-travel queries (multiple versions per key, branching history), discusses using it as a backend for RDF triple stores and full‑text indexes and reports working tests on datasets of a few gigabytes.
AI-written summary · about
chapters (6)
- 0:00Introduction
- 5:14SRFI-167 and SRFI-168 core
- 10:03Pattern matching in stores
- 15:39Performance benchmarks
- 20:26Future directions
- 23:05Closing remarks and Q&A
related talks
15m"Range as a Key" is the Key! Fast and Compact Cloud Block Store Index with RASK
26mFuture of FoundationDB Storage Engines
21mRedwood Storage Engine Update
18mRISC-V Support for Persistent Memory Systems
12mREMIX: Efficient Range Query for LSM-trees
12mROART: Range-query Optimized Persistent ART
17mA New Radix-Tree Based Memory Storage Engine
25mBuild Anything with FoundationDB