lancejpollard / tl-bplus-tree.js Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

4 B+ Tree Implementations from trincot on StackOverflow

1 star 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
i.js		i.js
i.test.js		i.test.js
k.js		k.js
k.test.js		k.test.js
package.json		package.json
readme.md		readme.md
s.js		s.js
s.test.js		s.test.js
test.js		test.js
v.js		v.js
v.test.js		v.test.js

Repository files navigation

TL-B+Tree in JavaScript

k is a key store B+tree
v is a key-value store B+tree
i is an index based B+tree
s is an stack/queue based B+tree

These are from the help of @trincot on StackOverflow. Used as a reference implementation for various B+trees, with the added constraint that all arrays are powers of two sized, to optimize for memory layout.

Goal would be, in a multithreaded environment, to make this work with concurrent B+trees like PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors.

About

4 B+ Tree Implementations from trincot on StackOverflow

javascript tree algorithms data-structures bplustree

Report repository

Releases

No releases published

Packages

No packages published

Languages

JavaScript 100.0%