[{"data":1,"prerenderedAt":65},["ShallowReactive",2],{"content:\u002F2025\u002F09\u002Fmysql-btree":3,"surround:\u002F2025\u002F09\u002Fmysql-btree":56},{"id":4,"title":5,"body":6,"categories":32,"date":34,"description":35,"draft":36,"extension":37,"image":38,"meta":39,"navigation":41,"path":42,"permalink":38,"published":38,"readingTime":43,"recommend":38,"references":38,"seo":48,"sitemap":49,"stem":50,"tags":51,"type":54,"updated":34,"__hash__":55},"content\u002Fposts\u002F2025\u002F09\u002Fmysql-btree.md","MySQL 索引原理：B 树",{"type":7,"value":8,"toc":28},"minimark",[9,18,21],[10,11,12],"p",{},[13,14,15],"a",{"href":15,"rel":16},"https:\u002F\u002Fwww.cs.usfca.edu\u002F~galles\u002Fvisualization\u002FBTree.html",[17],"nofollow",[10,19,20],{},"B树",[10,22,23],{},[24,25],"img",{"alt":26,"src":27},"image-20250901234340263","https:\u002F\u002Fcdn.jsdelivr.net\u002Fgh\u002Fcodepzj\u002Fimages@main\u002F20250901234341956.png",{"title":29,"searchDepth":30,"depth":30,"links":31},"",4,[],[33],"数据库","2025-09-01","介绍 B 树的结构、查找过程与平衡机制，并说明它作为数据库索引数据结构时的基本工作原理。",false,"md",null,{"slots":40},{},true,"\u002F2025\u002F09\u002Fmysql-btree",{"text":44,"minutes":45,"time":46,"words":47},"1 min read",0.01,600,2,{"title":5,"description":35},{"loc":42},"posts\u002F2025\u002F09\u002Fmysql-btree",[52,53],"MySQL","数据库索引","tech","DThKzrFT_gurGXDp-7GWNxVOxuDW9Uqsgdro9_xoDZg",[57,61],{"title":58,"path":59,"stem":60,"date":34,"type":54,"children":-1},"MySQL 索引原理：B+ 树","\u002F2025\u002F09\u002Fmysql-bplustree","posts\u002F2025\u002F09\u002Fmysql-bplustree",{"title":62,"path":63,"stem":64,"date":34,"type":54,"children":-1},"MySQL SQL 执行频次统计","\u002F2025\u002F09\u002Fmysql-execute-rate","posts\u002F2025\u002F09\u002Fmysql-execute-rate",1786555055762]