Peer-to-Peer Ordered Search Indexes – 0 FPS
“Can we do to web services what Linux did to the operating systems?” Imagine what the web with a P2P GitHub, a P2P YouTube, a P2P Twitter, a P2P Google search, and so on. But getting st…
“Can we do to web services what Linux did to the operating systems?” Imagine what the web with a P2P GitHub, a P2P YouTube, a P2P Twitter, a P2P Google search, and so on. But getting started with P2P services remains difficult, because: “There is no P2P PostGRES!” This is a very hard problem, so instead consider a more modest project: “Let’s build a dynamic P2P ordered search index” While pretty far from a full SQL database, a search index is a critical component for a modern RDBMS as it enables the following sorts of queries: Predecessor/successor Ran
related reading
- Building a web search engine from scratch in two months with 3 billion neural embeddingsblog.wilsonl.in
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- Merklizing the key/value store for fun and profit | Joel Gustafsonjoelgustafson.com
- Building a BFT JSON CRDTjzhao.xyz
- Build Your Own Databasenan.fyi
- Fast regex search: indexing text for agent tools · Cursorcursor.com
- CRDT optimizationsbartoszsypytkowski.com
- CRDTs go brrrjosephg.com
- Static B-Trees - Algorithmicaen.algorithmica.org
- Index 1,600,000,000 Keys with Automata and Rust - Andrew Gallant's Blogburntsushi.net
- How Cursor Indexes Codebases Fastread.engineerscodex.com
- Merkle Tree | Brilliant Math & Science Wikibrilliant.org