https://github.com/lancejpollard/tl-bplus-tree.js

4 B+ Tree Implementations from trincot on StackOverflow
https://github.com/lancejpollard/tl-bplus-tree.js

algorithms bplustree data-structures javascript tree

Last synced: about 2 months ago
JSON representation

4 B+ Tree Implementations from trincot on StackOverflow

• Host: GitHub
• URL: https://github.com/lancejpollard/tl-bplus-tree.js
• Owner: lancejpollard
• Created: 2021-01-10T20:36:51.000Z (about 4 years ago)
• Default Branch: build
• Last Pushed: 2022-02-16T02:44:30.000Z (almost 3 years ago)
• Last Synced: 2024-09-10T09:16:58.408Z (4 months ago)
• Topics: algorithms, bplustree, data-structures, javascript, tree
• Language: JavaScript
• Homepage:
• Size: 18.6 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md

Awesome Lists containing this project

README

        

# 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](https://stackoverflow.com/users/5459839/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](http://www.vldb.org/pvldb/vol4/p795-sewall.pdf)_.