forked from gcallah/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BTrees.html
145 lines (118 loc) · 4.01 KB
/
BTrees.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
<html>
<!-- THIS FILE WAS GENERATED BY A SCRIPT: DO NOT EDIT IT! -->
<head>
<link href="style.css" rel="stylesheet" type="text/css"/>
<title>
Design and Analysis of Algorithms: B-Trees
</title>
</head>
<body>
<div id="header">
<div id="logo">
<img src="graphics/Julia.png">
</div>
<div id="user-tools">
<a href="index.html">Home</a>
<a href="about.html">About</a>
<a href="feedback.html">Feedback</a>
</div>
</div>
<h1>
Design and Analysis of Algorithms: B-Trees
</h1>
<div style="text-align:center">
<p>
<img
src="https://upload.wikimedia.org/wikipedia/commons/thumb/6/65/B-tree.svg/831px-B-tree.svg.png"
height="180" width="600">
</p>
</div>
<h2>
Overview
</h2>
<p>
Balanced search trees designed to work well on secondary
storage devices.
</p>
<ul>
<li><b>Number of children:</b> A few, or thousands!
</li>
<li>O(lg n) performance.
</li>
<li>If an internal node contains <i>n</i> keys, then it has
<i>n</i> + 1 children. We make an <i>n</i> + 1 way decision
when reaching this node in search.
</li>
</ul>
<h3>
Data structures on secondary storage
</h3>
<p>
<b>The big difference:</b> We might be able to perform
100,000 accesses of primary memory in the time ot takes
to find the proper place to start a disk read.
</p>
<h2>
Definition of B-trees
</h2>
<p>
</p>
<h3>
The height of a B-tree
</h3>
<h2>
Basic Operations on B-trees
</h2>
<p>
</p>
<h3>
Searching a B-Tree
</h3>
<h3>
Creating an empty B-Tree
</h3>
<h3>
Inserting a key into a B-Tree
</h3>
<h4>
Splitting a node in a B-tree
</h4>
<h4>
Inserting a key into a B-Tree
in a single pass down the tree
</h4>
<h2>
Deleting a key from a B-tree
</h2>
<p>
</p>
<h2>
</h2>
<h2>
Source Code
</h2>
<p>
<a
href="https://github.com/gcallah/algorithms/blob/master/Python/b_trees.py">
Python
</a>
<br>
</p>
<h2>
For Further Study
</h2>
<h2>
Homework
</h2>
</body>
<script>
(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
})(window,document,'script','https://www.google-analytics.com/analytics.js','ga');
ga('create', 'UA-97026578-2', 'auto');
ga('send', 'pageview');
</script>
</html>