Building SmithDB's inverted index for full-text search: construction, compaction, and query routing
A technical deep dive into how LangChain built full-text search in SmithDB, from constructing and compacting inverted indexes to routing queries across local SSD and object storage.
Read the full articleYou might also wanna read
How Elasticsearch Finds Results in Milliseconds: Inverted Indexes and Shard Routing
Elasticsearch achieves fast full-text search by using an inverted index, which maps words to documents rather than scanning documents for wo
Technical Analysis of Robin Hood Hash Table Implementation with Linear Probing
I'm the kind of person who thinks about the design and implementation of hash tables. One design which I find particularly cute, and I think
Rethinking Database Architecture for the SSD Era: Beyond Spinning Disk Constraints
Maybe not what you think.
Understanding B-Trees: The Data Structure That Powers Database Performance on Disk
Understanding the data structure that makes databases fast on disk
mehmetgoekce.substack.com·7mo ago
ClickHouse Rebuilds Full-Text Search with Native Columnar Integration
A deep dive into ClickHouse’s built-in full-text search — how it works, what’s new, and how to use it for fast, precise text queries.
ClickHouse·10mo agoClickHouse Rebuilds Full-Text Search with Native Columnar Integration
A deep dive into ClickHouse’s built-in full-text search — how it works, what’s new, and how to use it for fast, precise text queries.
clickhouse.com·10mo agoFaster Index I/O with NVMe SSDs
The Marginalia Search index has been partially rewritten to perform much better, using new data structures designed to make better use of mo
Comments
Sign in to join the conversation.
No comments yet. Be the first.