Concurrent Btree's concurrency control is based on Optimistic locking principle. Salient features of this concurrency control are
- Very simple - minimal changes to code to support concurrency
- Good scalability
-
Notifications
You must be signed in to change notification settings - Fork 0
In-memory index implementation (btreemap, hashmap, ART-map)
License
harikrishnan94/InMemIndexes
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
In-memory index implementation (btreemap, hashmap, ART-map)
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published