Merge branch 'master' of https://github.com/malbrain/Btree-source-code

[btree] / README.md

diff --git a/README.md b/README.md
index 4a81c1ae04abdd60f2e2ed94bb8957196335be74..9ea76b242a368c66d5aa7aa5f5a062e794572b95 100644 (file)
--- a/README.md
+++ b/README.md
@@ -1,7 +1,7 @@
 Btree-source-code
 =================
 
-A working project for High-concurrency B-tree source code in C
+A working project for High-concurrency B-tree source code in C.  You probably want to download threadskv8.c for the latest developement version.
 
 Here are files in the btree source code:
 
@@ -25,9 +25,19 @@ threadskv2.c Multi-Threaded/Multi-Process based on threadskv1 that replaces the
 
 threadskv3.c   Multi-Threaded/Multi-Process based on threadskv1 that introduces librarian filler slots in the linear key array to minimize data movement when a new key is inserted into the middle of the array.
 
+threadskv4b.c  Multi-Threaded/Multi-Process based on threadskv3 that manages duplicate keys added to the btree.
+
+threadskv5.c   Multi-Threaded/Multi-Process based on threadskv4b that supports bi-directional cursors through the btree. Also supports raw disk partitions for btrees.
+
+threadskv6.c   Multi-Threaded/Single-Process with traditional buffer pool manager using the swap device.  Based on threadskv5 and btree2u.
+
+threadskv7.c   Multi-Threaded/Single-Process with atomic add of a set of keys under eventual consistency.  Adds an individual key lock manager.
+
+threadskv8.c   Multi-Threaded/Single-Process with atomic-consistent add of a set of keys based on threadskv6.c.  Uses btree page latches as locking granularity.
+
 Compilation is achieved on linux or Windows by:
 
-gcc -D STANDALONE threads2h.c -lpthread
+gcc -D STANDALONE -O3 threadskv8.c -lpthread
 
 or