搜索资源列表
BTree
- b+tree树的java实现。 是一个框架， 可以往里加新的东西， 实现复杂的功能-b tree tree java achieve. Is a framework that can be poured plus new things and realize complex functions
java Tree （jsp+javabea）
- b/s下jsp+javabean实现从数据库中读取数据生成目录树-b / s jsp javabean achieve read from the database data generation tree
BPlusTree
- 基于JAVA的B+树数据结构，B+树是改进的平衡二叉树，查询效率更高。-JAVA-based B+-tree data structure, B+ tree is an improved balanced binary tree, the query more efficient.
db
- B+ tree JAVA source code for implementing Insertion and Deletion
BTree
- B+树,B+树的插入删除建立查询等功能，都已经实现，可以初始化建立一棵树再往里插入新数据，删除，查找。-B+ tree
B
- b树，用于空间搜索引擎，非常实用，特别好-b tree, for the space search engine, very useful, especially good
BPTree
- 具体实现了B+tree，对于初学者，或者想实现此数据结构的朋友，别错过-Concrete realization of the B+ tree, for the beginner, or want to achieve this data structure a friend, not to miss
BTree
- 实现了B树的基本功能，增、删、改、遍历等方法，完成了B树的基本架构-To achieve the basic functions of the B tree, increase, delete, change, traversal and other methods to complete the basic structure of the B tree
k-DNA
- k-长DNA子序列在DNA全序列中出现频数的计数问题。该算法通过一个哈希函数把k－长DNA子序列映射为整数关键字从而把k-长DNA子序列出现频数的计数问题转化为整数关键字的重复计数问题，使得能够利用经典B树算法来解决k-长DNA子序列的出现频数计数问题-k-long DNA sequence in the DNA sequence in the frequency of counting problems arise. In the algorithm, a hash function to k
Bplustree
- This a sample B plus tree implementation-This is a sample B plus tree implementation
tokyocabinet-java-1.24.tar
- Tokyo cabinet C 库代码的Java绑定接口。 Tokyo cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表、b树和定长数据组织。-The Tokyo Cabinet C libaray s Java binding. Tokyo Cabinet is a library of routine
btrees
- B-tree implementation
dictionary
- 读入相关英语单词以及解释，制作成简单的英汉词典。采用红黑树及B树。-Reads English words as well as explain, made into simple English-Chinese dictionary. Red-black tree and B-tree.
BPlusTree
- 基于外存的B+树，用JAVA实现了一个B+树，包括B+树的构成，B+树的增删查改。-Based external memory B+ tree, using JAVA a B+ trees, including composition of B+ tree CRUD the B+ tree.
Project1
- 分别用红黑树和B树实现的字典，有查询功能，范围查找功能等-dictionary implemented by rb tree and b tree
sqsdbserver1.0
- 一个用B+TREE方式实现的采用NIO实现的,灵活的队列,支持动态排序-One way to achieve with B+ TREE NIO realized using flexible queue, support for dynamic ordering
BPTree
- 该代码实现了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.
MTreeMapRepo-master
- M-Tree是类似R-Tree和B-Tree的树形数据结构。它是用一个metric构建的，有效范围依赖于三角不等式，使用K-NN（K临近算法）查询，该程序实现创建和应用-create and apply the M-tree
Mini-Dictionary
- this the document of dictionaries binary tree search b-tree is collected by sotrym- this is the document of dictionaries binary tree search b-tree is collected by sotrym
B_Tree1
- also về mô phỏ ng b-tree bằ ng c # have a few missing số t- also về mô phỏ ng b-tree bằ ng c # have a few missing số t