From 88cdf963342ab55a8ea8a9ee8abf642b295db46a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E7=BB=93=E5=8F=91=E5=8F=97=E9=95=BF=E7=94=9F?=
 <init_pro@aliyun.com>
Date: Wed, 17 Jul 2019 09:27:24 +0800
Subject: [PATCH] =?UTF-8?q?=E5=9B=BE=E7=89=87=E8=B7=AF=E5=BE=84=E8=BD=AC?=
 =?UTF-8?q?=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 source/_posts/算法/数据库索引原理浅析.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/source/_posts/算法/数据库索引原理浅析.md b/source/_posts/算法/数据库索引原理浅析.md
index 09e6850..9f27ff3 100644
--- a/source/_posts/算法/数据库索引原理浅析.md
+++ b/source/_posts/算法/数据库索引原理浅析.md
@@ -65,7 +65,7 @@ categories:
 + 其他节点只是在搜索中用来指引到正确节点的
 + 临近的叶子节点是相连的, 构成链表结构
 
-![B+树](/images/算法/B+树.png)
+![B+树](/images/算法/B%2b树.png)
 
 当然会造成节点的数量更多, 但是这个树的深度只是增加了1, 即使是从中搜索某个特定的值, 时间复杂度仍然是O(log<sub>2</sub>(n))