Alawn/architect-awesome
1
0
Fork 0
mirror of https://github.com/xingshaocheng/architect-awesome.git synced 2026-11-03 22:53:41 +00:00
Code Issues Releases Wiki Activity

Merge pull request #69 from LLcat1217/patch-1

Browse Source 
fixed error title
This commit is contained in:
xingshaocheng
2018-09-16 10:00:18 +08:00
committed by GitHub
parent 9bf783415d 5d9bd40b84
commit 391df2e1a2
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
+3 -3
View File
@@ -23,7 +23,7 @@
* [平衡二叉树](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#平衡二叉树)
* [二叉查找树（BST）](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#二叉查找树bst)
* [红黑树](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#红黑树)
* [B-，B+，B*树](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#b-bb树)
* [B，B+，B*树](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#b-bb树)
* [LSM 树](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#lsm-树)
* [BitSet](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#bitset)
* [常用算法](https://github.com/xingshaocheng/architect-awesome/blob/master/README.md#常用算法)
@@ -406,12 +406,12 @@
* 添加阶段后，左旋或者右旋从而再次达到平衡。
* [《浅谈算法和数据结构: 九 平衡查找树之红黑树》](http://www.cnblogs.com/yangecnu/p/Introduce-Red-Black-Tree.html)
### B-，B+，B*树
### B，B+，B*树
MySQL是基于B+树聚集索引组织表
* [《B-树，B+树，B\*树详解》](https://blog.csdn.net/aqzwss/article/details/53074186)
* [《B-树，B+树与B\*树的优缺点比较》](https://blog.csdn.net/bigtree_3721/article/details/73632405)
* B+ 树的叶子节点链表结构相比于 B- 树便于扫库，和范围检索。
* B+树的叶子节点链表结构相比于 B-树便于扫库，和范围检索。
### LSM 树
LSM（Log-Structured Merge-Trees）和 B+ 树相比，是牺牲了部分读的性能来换取写的性能(通过批量写入)，实现读写之间的。