<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>B+Tree on 梦兽编程</title><link>https://rexai.top/en/tags/b+tree/</link><description>Recent content in B+Tree on 梦兽编程</description><generator>Hugo -- 0.163.3</generator><language>en</language><copyright>梦兽编程</copyright><lastBuildDate>Mon, 13 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://rexai.top/en/tags/b+tree/index.xml" rel="self" type="application/rss+xml"/><item><title>Building a B+Tree in Rust: What I Got Wrong Before Getting It Right</title><link>https://rexai.top/en/languages/rust/2026-07-13-btree-rust-pitfalls/</link><pubDate>Mon, 13 Jul 2026 00:00:00 +0000</pubDate><guid>https://rexai.top/en/languages/rust/2026-07-13-btree-rust-pitfalls/</guid><description>A walkthrough of design mistakes I made implementing a B+Tree in Rust — from treating all nodes as in-memory pointers to understanding database pages, buffer pools, and record IDs. For developers learning database internals or systems programming in Rust.</description></item></channel></rss>