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
Explore this link on the map →related reading
- Merkle Tree | Brilliant Math & Science Wikibrilliant.org
- Merklizing the key/value store for fun and profit | Joel Gustafsonjoelgustafson.com
- How Cursor Indexes Codebases Fast - by Engineer's Codexread.engineerscodex.com
- opentimestamps-server/doc/merkle-mountain-range.md at master · opentimestamps/opentimestamps-server · GitHubgithub.com
- Prolly Trees | DoltHub Blogdolthub.com
- Build Your Own Databasenan.fyi
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- Building a web search engine from scratch in two months with 3 billion neural embeddingsblog.wilsonl.in
- commonware > Merkle Mountain Ranges for Performant Data Authenticationcommonware.xyz
- Introduction of B Tree - GeeksforGeeksgeeksforgeeks.org
- What is a Merkle Tree?decentralizedthoughts.github.io
- Merkle Trees & Merkle Roots: Bitcoin & Blockchain | Geminigemini.com