{"id":27443116,"url":"https://github.com/mansi-k/bplustree_rangeq","last_synced_at":"2025-04-15T01:19:22.083Z","repository":{"id":207186823,"uuid":"339163603","full_name":"mansi-k/BplusTree_rangeQ","owner":"mansi-k","description":"Implemented B+ Tree for executing range queries on large SQL records","archived":false,"fork":false,"pushed_at":"2021-02-20T08:22:47.000Z","size":1556,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-15T01:19:04.493Z","etag":null,"topics":["b-plus-tree","large-files","range-query","range-search","scratch-implementation"],"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/mansi-k.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,"governance":null}},"created_at":"2021-02-15T18:03:44.000Z","updated_at":"2021-10-08T18:51:45.000Z","dependencies_parsed_at":"2023-11-14T14:55:58.344Z","dependency_job_id":null,"html_url":"https://github.com/mansi-k/BplusTree_rangeQ","commit_stats":null,"previous_names":["mansi-k/bplustree_rangeq"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mansi-k%2FBplusTree_rangeQ","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mansi-k%2FBplusTree_rangeQ/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mansi-k%2FBplusTree_rangeQ/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mansi-k%2FBplusTree_rangeQ/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mansi-k","download_url":"https://codeload.github.com/mansi-k/BplusTree_rangeQ/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248986316,"owners_count":21194025,"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":["b-plus-tree","large-files","range-query","range-search","scratch-implementation"],"created_at":"2025-04-15T01:19:21.630Z","updated_at":"2025-04-15T01:19:22.068Z","avatar_url":"https://github.com/mansi-k.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DS ASSIGNMENT 3  \r\n\r\n## Execution  \r\n1) Compile: `g++ -o main main.cpp`  \r\n2) Run (to print output on terminal): `./main \u003cinput_file\u003e`  \r\n3) Run (to save output to a file): `./main \u003cinput_file\u003e \u003e \u003coutput_file\u003e`  \r\n\r\n## Implementation\r\nQueries implemented: INSERT, FIND, COUNT, RANGE.  \r\nCall print_tree() function to see the structure of the tree.  \r\nCall print_allkeys() function to see all values inserted in the tree.  \r\nTo change the order (max no. of keys in a node) of the tree (order \u003e= 2), change the MAX_KEYS definition (though not well tested for order!=2).  \r\nEach tree node stores: MAX_KEYS no. of keys, MAX_KEYS+1 no. of child-node pointers, pointer to the parent-node, pointer to the next (right) sibiling-node (only for leaf nodes) and an is_leaf flag.  \r\n\r\n## Assumptions\r\nInput files should be in the same folder.  \r\nOutput file would be created in the same folder.  \r\nInput file should be in the same format as given in the doc: keywords in capital letters, each query on a new line, each element in a query has 1 space in between.  \r\nHere order means max no. of keys in any node (default order=2).  \r\nCode tested for only order=2 (as given in doc) though implemented for other orders too.  \r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmansi-k%2Fbplustree_rangeq","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmansi-k%2Fbplustree_rangeq","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmansi-k%2Fbplustree_rangeq/lists"}