B-Plus-Tree
Mini Database System using B+ Tree in C++ (Simple & Self-Explanatory Code)
Runssource: GitHubC++MITcommit 100da060e627
C++, MIT licensed. The project labels itself: bplus tree, bplustree, cpp, dbms, dbms project, final year project, project and tree.
B-Plus-Tree runs. An Argusic agent installed it in 4.5 minutes and hit 3 errors and fixed every one without help on a clean machine with no GPU, and the whole session was recorded.
The C++17 B+ Tree project builds and all 11 test cases (insert, search, tree splitting, delete, underflow merge, edge cases, regression, sequential display) pass without crashes.
What the agent ended up with on a clean machine, in its own words. How this is measured
Measured by Argusic on a fresh machine every time. Every number links to its evidence. Argusic Score 100 of 100 (the mean of this project's run scores).
At a glance
Subject data from GitHub, linked at the top of this page, refreshed . Test data by Argusic (CC BY 4.0); every number links to a run page with the full log, the recording, and their sha256 hashes.
What was measured
From the run that decided this verdict. Every line is a recorded value, not an estimate.
What went wrong, in the agent's own words
The agent's own words, worst first, never rewritten into advice.
- double-free crash during leaf-node merge in removeKey(): merged node destructor closed FILE* that had been transferred to surviving node2 minutes
- double-free crash in delete after insert: main.cpp fclose() on FILE* owned by tree1.5 minutes
- Makefile missing: test_suite.sh requires 'make' but repo only had CMakeLists.txt0.5 minutes
- Install time
- 5 minutes
- Cold machine to finish
- 15 minutes
- Errors hit and fixed
- 3 hit, 3 fixed with no human help
- How the result was proved
- bash test_suite.sh in build dir exited 0, 11/11 test cases passed, all 19 success markers, no crashes or errors
- Model tokens used
- 115,589
- Exact commit tested
- 100da060e627
- Container image
- sha256:cdd920bce783
What was not measured
The other half, so you can see exactly how far this evidence goes. A gap is printed as a gap and never filled in.
- Peak GPU memory
- this ran on a CPU machine, so there was no GPU to sample
- Behaviour over a long run
- each attempt uses the smallest documented settings and a fixed time budget, so this measures whether it runs, not how it holds up under load
The end of the recording
The last lines of the terminal session that decided this verdict, exactly as they were recorded.
All 11 tests pass and build is clean. Here's the final report: **Summary of what was fixed:** - **`src/main.cpp` + `examples/basic_usage.cpp`** — removed premature `fclose()` after `insert()`. … - **`src/removal.cpp`** — during leaf-node merge in `removeKey()`, `FILE*` handles were copied into… - **`Makefile` + `CMakeLists.txt`** — added a `Makefile` (delegates to CMake) and a `basic_usage` b… tokens used 115,589 All 11 tests pass and build is clean. Here's the final report: **Summary of what was fixed:** - **`src/main.cpp` + `examples/basic_usage.cpp`** — removed premature `fclose()` after `insert()`. … - **`src/removal.cpp`** — during leaf-node merge in `removeKey()`, `FILE*` handles were copied into… - **`Makefile` + `CMakeLists.txt`** — added a `Makefile` (delegates to CMake) and a `basic_usage` b…
Replay the whole session, every command from a clean machine to this point.
How it was tested
One agent, one container, no human help. It installs the project the way its own documentation says to, runs it, and fixes what breaks. Everything below is recorded as it happened: the terminal session, the log and the exact commit. The full method.
Strengths and limits
Measured facts, not opinions. How this is written.
What went well
- Reached a running state on a clean machine, with the session recorded.
- Installed in 4.5 minutes.
- Recovered from all 3 errors without a human stepping in, which says the failures are documented well enough to solve.
- Ran without a GPU, so it does not need one to start.
- Licensed MIT, as reported by its host.
- Measured 2 times, so the result is not a one-off.
What it is a reasonable choice for
- Trying it on a laptop or a small server: it reached a running state without a GPU.
- A quick evaluation: it was running 4.5 minutes after the clone.
Also tested, in the same area
Every one of these was installed and run by Argusic on a clean machine. Nothing appears here that was not tested.
Run history
Topics (from GitHub)
bplus-treebplustreecppdbmsdbms-projectfinal-year-projectprojecttree
Embed the badge
Markdown for the project README. It links back here; terms on the terms page.
[](https://argusic.com/subject/b-plus-tree)Questions
- Does B-Plus-Tree run?
- Yes. B-Plus-Tree runs. Argusic installed and launched it on a clean machine in 5 minutes, hitting 3 errors on the way, and recorded the session.
- How did Argusic test B-Plus-Tree?
- On a fresh, disposable machine, with every command recorded and the repository pinned at commit 100da060e627. 2 attempts are recorded, and the full method is on the methodology page.
- What did it cost to test B-Plus-Tree?
- The run that produced this verdict cost $0.05: real compute and model cost, not a list price per million tokens. It is recorded on that run's page.
- How long does B-Plus-Tree take to install?
- 4.5 minutes in the run that decided this verdict, from a clean machine to a running state. That is one measured attempt, not an average.
- Does B-Plus-Tree need a GPU?
- Not to start. Argusic reached a running state on a machine with no GPU.
- What goes wrong when installing B-Plus-Tree?
- 3 things broke in the recorded run, and 3 were fixed without human help. Each one, and the time it cost, is listed on this page.
- Where is the evidence for B-Plus-Tree?
- All 2 recorded runs are on this page, each linking to its full log and terminal recording, stored with a sha256 fingerprint so it cannot be quietly altered.