B-Trees Are Back: Engineering Fast and Pageable Node Layouts
Summary
The research paper "B-Trees Are Back: Engineering Fast and Pageable Node Layouts" explores how to design faster, pageable B-tree node layouts to improve database index performance on modern hardware.
View Cached Full Text
Cached at: 10/09/26, 06:37 AM
Similar Articles
@pritipatelor: The entire RAG industry is about to be turned upside down Researchers have come up with a brand-new RAG solution that n…
研究人员推出名为 PageIndex 的全新 RAG 方案，无需向量数据库、嵌入或分块，而是构建树状索引让大模型像人类读书一样检索，在 FinanceBench 上以 98.7% 的准确率超越所有向量 RAG 方法，且完全免费开源。
@petermattis: B-trees kept coming up on the Pragmatic Engineer podcast this week. The simple B-tree explanation: each node packs many…
Peter Mattis (CTO/cofounder of Cockroach Labs) shares a thread explaining B-tree node layout and spatial locality, inspired by recent B-tree discussions on the Pragmatic Engineer podcast.
@cevenif: Traditional RAG is being directly overturned by a tool called PageIndex. It doesn't need vector databases, embeddings, chunking, or even similarity search. Instead, it builds a tree index for documents, allowing LLMs to drill down layer by layer like a human. On FinanceBench, it achieved 98.7%...
PageIndex is an open-source tool that builds a tree index of documents, eliminating the need for vector databases and embeddings, enabling efficient LLM retrieval. It achieves 98.7% accuracy on FinanceBench.
SQLite improving performance with pre-sort
This article demonstrates that pre-sorting random data before inserting into SQLite can improve insert performance by 2-3x, by leveraging the B+ Tree's ordered nature and reducing page splits.
Scaling and benchmarking a critical message bus using a new indexing strategy
Jane Street 分享了其内部消息框架 Aria 的扩展实践：通过为 topic partition 引入索引与树拆分策略优化 tip recovery 过滤流程，在生产负载上实现 30% 的 CPU 使用率下降。