Commit ae68028a authored Jun 27, 2021 by Tat Dat Duong

chore: update README.md

parent 2164ec93

README.md

+9 −1

Original line number	Diff line number	Diff line
		@@ -7,3 +7,11 @@ This is an implementation of B+Tree and B-Link-Tree data structures for TNL capa
		- `implementation` - Contains the implementation of B+Tree and B-Link-Tree, each in their separate folders.
		- `benchmark` - Comparison against state-of-art GPU and other CPU implementations.
		- `debugger` - Web App used for debugging and visualizing B-Tree operations

		## Third-party implementations for benchmark

		Source code of existing implementations are not included in this thesis by default and must be fetched separately.

		```bash
		git submodule update --init
		```
		No newline at end of file

debugger/README.md

0 → 100644

+10 −0

Original line number	Diff line number	Diff line
		# B-Tree debugger

		Complementary web app for debugging concurrent B-Tree data structure.

		## Installation

		```bash
		yarn
		yarn start
		```

implementation/README.md

0 → 100644

+6 −0

Original line number	Diff line number	Diff line
		# TNL B-Tree

		Implementation of B-Tree data structures. Two implementations are presented here:

		- B+Tree: implementation of B+Tree, storing key/values in leaf nodes
		- B-Link-Tree: extension of B+Tree based on the work by Lehman and Yao (1981)