blink tree implementation in go
- Efficient locking for concurrent operations on B-trees
- Concurrency control and recovery for balanced Blink trees
- A Blink Tree method and latch protocol for synchronous node deletion in a high concurrency environment
mgr := NewBufMgr("data/sample.db", 13, 20)
bltree := NewBLTree(mgr)
bltree.insertKey([]byte{1, 2, 3, 4}, 0, [6]byte{0, 0, 0, 0, 0, 1}, true)
_, foundKey, _ := bltree.findKey([]byte{1, 2, 3, 4}, 6)
fmt.Println(bytes.Compare(foundKey, []byte{1, 2, 3, 4}) == 0) // true
