GitHub - swatianand56/B-Tree-with-Concurrent-HashMap: Imlementation of Concurrent HashMaps in simulated B-Tree indexes to handle load contention in sales databases

swatianand56 / B-Tree-with-Concurrent-HashMap Public

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

Imlementation of Concurrent HashMaps in simulated B-Tree indexes to handle load contention in sales databases

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
build		build
gradle/wrapper		gradle/wrapper
src/cs764		src/cs764
README		README
build.gradle		build.gradle
gradlew		gradlew
gradlew.bat		gradlew.bat
settings.gradle		settings.gradle

Repository files navigation

Install Java(1.8.0_191 or higher)

https://java.com/en/download/help/linux_x64_install.xml

To build:
./gradlew build

To run:
./gradlew run -PmyArgs='[arg1, arg2, arg3, arg4, arg5]'

Command line arguments are as follows:
arg1: Number of threads
arg2: Number of keys to be inserted
arg3: Branching Factor
arg4: Load Factor
arg5: Concurrency Factor
arg6: B-tree or B-tree + CHM (0 - for B-tree, 1 - for B-tree + CHM)

Example:

For inserting 1 million keys in B-tree using 8 threads and 128 branching factor with load factor and 
concurrency factor of CHM being 4 and 0.75 respectively

./gradlew run -PmyArgs='[8,1000000,128, 4, 0.75, 0]'

For inserting 1 million keys in B-tree + CHM using 8 threads and 128 branching factor with load factor and 
concurrency factor of CHM being 4 and 0.75 respectively

./gradlew run -PmyArgs='[8,1000000,128, 4, 0.75, 1]'