{"id":13629023,"url":"https://github.com/malbrain/Btree-source-code","last_synced_at":"2025-04-17T04:32:51.981Z","repository":{"id":8923227,"uuid":"10651821","full_name":"malbrain/Btree-source-code","owner":"malbrain","description":"A working project for High-concurrency B-tree source code in C","archived":false,"fork":false,"pushed_at":"2020-08-29T01:07:34.000Z","size":792,"stargazers_count":246,"open_issues_count":3,"forks_count":48,"subscribers_count":25,"default_branch":"master","last_synced_at":"2024-11-08T19:43:02.038Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/malbrain.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-06-12T20:47:14.000Z","updated_at":"2024-10-12T07:54:27.000Z","dependencies_parsed_at":"2022-09-10T08:41:40.627Z","dependency_job_id":null,"html_url":"https://github.com/malbrain/Btree-source-code","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/malbrain%2FBtree-source-code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/malbrain%2FBtree-source-code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/malbrain%2FBtree-source-code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/malbrain%2FBtree-source-code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/malbrain","download_url":"https://codeload.github.com/malbrain/Btree-source-code/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":249316027,"owners_count":21249879,"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":[],"created_at":"2024-08-01T22:01:01.646Z","updated_at":"2025-04-17T04:32:48.794Z","avatar_url":"https://github.com/malbrain.png","language":"C","funding_links":[],"categories":["C"],"sub_categories":[],"readme":"Btree-source-code\n=================\n\nA working project for High-concurrency B-tree source code in C.  You probably want to download the separate database project for the latest version.  Most C files compile under both Windows and Linux.\n\nAn idea being investigated in the multi-root-node subdirectory removes the locking load on the root node by creating a read-only copy of the latest updated root version.  The root is updated out-of-band.\n\nNew B-tree page management code using a skiplist instead of sorted arrays for key searching is under development in a sub-directory.  This approach removes the need for a latching protocol for page reading and writing.\n\nNote:  The most recent running multi-threaded/multi-process B-tree and ARTree code can be found in a separate repository:  https://github.com/malbrain/database.\n\nHere are the projects under btree-source-code:\n\n* btree2:\t\tSingle Threaded/MultiProcess versions that remove keys all the way back to an original empty btree, placing removed nodes on a free list.  Operates under either memory mapping or file I/O.  Recommended btrees hosted on network file systems.\n\n* threads2:\t\tMulti-Threaded with latching implemented by a latch manager with test \u0026 set latches in the first few btree pages.\n\n* threadskv:\tMulti-Threaded/Multi-Process based on threads2i.c that generalizes key/value storage in the btree pages. The page slots are reduced to 16 or 32 bits, and the value byte storage occurs along with the key storage.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmalbrain%2FBtree-source-code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmalbrain%2FBtree-source-code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmalbrain%2FBtree-source-code/lists"}