Location:
Search - bptree
Search list
Description: 按照Clifford A . Shaffer《数据结构与算法分析（第二版）》指导，用C#实现的B+树，接口定义良好。最好重写“从文件载入新建树部分”的代码以提高建树效率。实现细节之一：当“需要插入子节点的节点”已满而相邻节点未满时会平分两者节点而不是分裂该节点。
Platform: |
Size: 20228 |
Author: godblesswho |
Hits:
Description: 详细介绍了Btree的特性以及如何实现
适合初学者参考
Platform: |
Size: 4190 |
Author: 范凡 |
Hits:
Description: 清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value / means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
Platform: |
Size: 3777 |
Author: qqiang |
Hits:
Description: 清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
Platform: |
Size: 3072 |
Author: qqiang |
Hits:
Description: 按照Clifford A . Shaffer《数据结构与算法分析（第二版）》指导，用C#实现的B+树，接口定义良好。最好重写“从文件载入新建树部分”的代码以提高建树效率。实现细节之一：当“需要插入子节点的节点”已满而相邻节点未满时会平分两者节点而不是分裂该节点。-According to Clifford A. Shaffer
Platform: |
Size: 19456 |
Author: |
Hits:
Description: 详细介绍了Btree的特性以及如何实现
适合初学者参考-Described in detail the characteristics of Btree suitable for beginners as well as how to achieve reference
Platform: |
Size: 4096 |
Author: 范凡 |
Hits:
Description: BPTree源代码，说明BPTree的功能-BPTree source code to illustrate the function of BPTree
Platform: |
Size: 19456 |
Author: li xiaowen |
Hits:
Description: 具体实现了B+tree，对于初学者，或者想实现此数据结构的朋友，别错过-Concrete realization of the B+ tree, for the beginner, or want to achieve this data structure a friend, not to miss
Platform: |
Size: 18432 |
Author: 陈诚 |
Hits:
Description: B+树的动态实现，可以选择阶数，动态开辟内存，删除，添加，查找功能。-Dynamic implementation of B+ tree, you can choose the order, dynamic open up memory, delete, add, search functions.
Platform: |
Size: 303104 |
Author: 王中杰 |
Hits:
Description: B+树数据结构，给出了b+树中各种常用的函数-B+ tree data structure, b+ tree is given a variety of commonly used functions
Platform: |
Size: 3072 |
Author: yangqiang |
Hits:
Description: 程序通过B树的存储结构，实现了B树的构造，显示，关键字的插入删除等基本索引功能-Program through the B-tree storage structure, to achieve a B-tree structure display keyword insertion and deletion basic indexing feature
Platform: |
Size: 7168 |
Author: pxxxb |
Hits:
Description: 这是数据结构中学习的B+树，有c++开发实现，详细理解了输的结构，有助于对数据结构初学者，可以参考学习-Is the learning B+ data structure tree a c++ achieve development, a detailed understanding of the structure of the lost, the help of the data structure beginners can refer to learning
Platform: |
Size: 64512 |
Author: 陈欣 |
Hits:
Description: 1、枝干节点的关键字在每个叶子节点的最后一个
2、叶子节点中的Vals不是值集合，而是值指针集合，主要是减少移动时的拷贝时间
本来也想Keys也做也指针集合，但是会有一个问题，如果当做数据库的索引，它就必需调阅多个页
当然Keys是值集合也会有问题，对于字符串来作Key就会有对象拷贝的问题
因此我觉得要实现两种B+树，一种是值集合的，一种是值指针集合的，
对此有兴趣的朋友可以共同探讨，发邮件至 xtlxs1976@163.com
3、算法书上说B+树比B-树要简单，它认为被删除的Key仍可以保留在树枝干中，我觉得或许作为
磁盘或数据库的索引管理是合理的，但作为一个完整的算法B+树比B-树要复杂得多,比如删除一个KEY后的调整有八种情况，而B-树只要考虑四种。-b+ tree 实现
Platform: |
Size: 58368 |
Author: 云笑 |
Hits:
Description: B+树程序，数据库课程设计，实现增删改查功能。-B+ tree program, database curriculum design, implement CRUD functionality,
Platform: |
Size: 12288 |
Author: 许佳丽 |
Hits:
Description: A database is an organized collection of data. The data are typically organized to model relevant aspects of reality in
a way that supports processes requiring this information. For example, modeling the availability of rooms in hotels in
a way that supports finding a hotel with vacancies.-Achieve B+ tree
Platform: |
Size: 3072 |
Author: 高常宽 |
Hits:
Description: 这个结构一般用于数据库的索引，综合效率非常高，像 Berkerly DB , sqlite , mysql 数据库都使用了这个算法处理索引。
如果想自己做个小型数据库，可能参考一下这个算法的实现，可能会对你有所帮助。 -This structure is generally used to index the database, the overall efficiency is very high, like Berkerly DB, sqlite, mysql databases are indexed using this algorithm processing. If you want yourself to be a small database, you may refer to this algorithm, it may be helpful to you.
Platform: |
Size: 60416 |
Author: 肖秋雨 |
Hits:
Description: A b+ tree, already implemented.
Platform: |
Size: 1024 |
Author: Decks on Cris |
Hits:
Description: 该代码实现了b+树的索引，插入与删除等功能，还具有快速查找的性能，并且算法时间复杂度性能较优.-The code to achieve the index b+ tree, insert and delete functions, but also has the capability to quickly find, and the algorithm time complexity better performance.
Platform: |
Size: 313344 |
Author: LHY |
Hits:
Description: b+树能够实现节点添加，节点删除，节点查找功能，非常适合初学者学习-b+ tree node can be achieved to add, delete nodes, node search function, very suitable for beginners to learn
Platform: |
Size: 19456 |
Author: Igniz |
Hits: