blob: 85dd9ebd1488a488b5ada2e711276869190df2e2 (
plain)
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
|
BTree
=====
An array based C-implementation of BTrees attempting a reasonable performance.
_a B-tree is a self-balancing tree data structure that maintains sorted data and
allows searches, sequential access, insertions, and deletions in logarithmic
time_
-- [Wikipedia](https://en.wikipedia.org/wiki/B-tree)
BTrees are -- algorithm wise -- implemented using pointers to subtrees which is
horribly slow on hardware. This project aims to optimize this, by putting the
whole struct into an array which can be iterated through in-order.
## Installation
todo
## Usage
todo
# Progress
## Naive
* [x] Searching
* [x] Insertion
* [x] Deletion
## Flat-sequential
* [ ] Searching
* [ ] Insertion
* [ ] Deletion
## Parallel
* [ ] Searching
* [ ] Insertion
* [ ] Deletion
|
