{"id":13439912,"url":"https://github.com/begeekmyfriend/bplustree","last_synced_at":"2025-05-15T18:10:38.030Z","repository":{"id":21188269,"uuid":"24494870","full_name":"begeekmyfriend/bplustree","owner":"begeekmyfriend","description":"A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage","archived":false,"fork":false,"pushed_at":"2023-01-04T10:45:30.000Z","size":224,"stargazers_count":1863,"open_issues_count":2,"forks_count":315,"subscribers_count":78,"default_branch":"disk-io","last_synced_at":"2024-10-29T17:48:56.311Z","etag":null,"topics":["algorithm","bplustree","btree","c","data-structure","storage","tree","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/begeekmyfriend.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-09-26T09:58:35.000Z","updated_at":"2024-10-25T05:33:46.000Z","dependencies_parsed_at":"2023-01-11T21:06:51.231Z","dependency_job_id":null,"html_url":"https://github.com/begeekmyfriend/bplustree","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fbplustree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fbplustree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fbplustree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fbplustree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/begeekmyfriend","download_url":"https://codeload.github.com/begeekmyfriend/bplustree/tar.gz/refs/heads/disk-io","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254394724,"owners_count":22063984,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","bplustree","btree","c","data-structure","storage","tree","tree-structure"],"created_at":"2024-07-31T03:01:18.124Z","updated_at":"2025-05-15T18:10:37.995Z","avatar_url":"https://github.com/begeekmyfriend.png","language":"C","funding_links":[],"categories":["C"],"sub_categories":[],"readme":"# B+Tree\nA minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix.\n\n## Branch\n[in-memory](https://github.com/begeekmyfriend/bplustree/tree/in-memory) for learning and debugging.\n\n## Demo\n```shell\n./demo_build.sh\n```\n\n## Code Coverage Test\n\n**Note:** You need to `rm /tmp/coverage.index*` for this testing every time because the configuration (i.e block size and order etc.) in those index files is immutable!\n\n```shell\n./coverage_build.sh\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbegeekmyfriend%2Fbplustree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbegeekmyfriend%2Fbplustree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbegeekmyfriend%2Fbplustree/lists"}