Location:
Search - b tree in java
Search list
Description: R树与B树的混合树，在这个程序里面可以直接用R树和B树-R and B-tree tree of mixed tree, in the inside can directly with the R and B-tree tree
Platform: |
Size: 913132 |
Author: 张军旗 |
Hits:
Description: 一个简单好用的B+树算法实现- A simple easy to use B tree algorithm realizes
Platform: |
Size: 6144 |
Author: 站长 |
Hits:
Description: 一个用Java applet实现的B-Tree算法- The B-Tree algorithm which realizes with Java applet
Platform: |
Size: 13312 |
Author: 站长 |
Hits:
Description: java 版B+树程序-java version of B+ tree procedure
Platform: |
Size: 11264 |
Author: 吕荣 |
Hits:
Description: 数据结构中的B-TREE的实现-data structure of the B-TREE Implementation
Platform: |
Size: 9216 |
Author: 神 |
Hits:
Description: B＋树实现源码，JAVA语言，数据库索引技术-B+ Tree source, Java language, database indexing technology
Platform: |
Size: 43008 |
Author: 蔡建山 |
Hits:
Description: 支持并发访问的B+树-support concurrent visit the B-tree
Platform: |
Size: 219136 |
Author: 纳跃跃 |
Hits:
Description: R树与B树的混合树，在这个程序里面可以直接用R树和B树-R and B-tree tree of mixed tree, in the inside can directly with the R and B-tree tree
Platform: |
Size: 1152000 |
Author: 张军旗 |
Hits:
Description: 实现avl树和b+树以及用他们管理的数据库demo-achieve AVL tree and b tree and use their database management demo
Platform: |
Size: 3146752 |
Author: leaing |
Hits:
Description: b+tree树的java实现。 是一个框架， 可以往里加新的东西， 实现复杂的功能-b tree tree java achieve. Is a framework that can be poured plus new things and realize complex functions
Platform: |
Size: 3072 |
Author: |
Hits:
Description: Here is a demo on B plus tree~
Platform: |
Size: 7168 |
Author: Chan Fuk Wai |
Hits:
Description: java版b树源码，已经调试过，很好，很强大，希望对大家有所帮助。-b tree java source version has debugging, and very good, very powerful and we hope to be helpful.
Platform: |
Size: 7168 |
Author: willee |
Hits:
Description: Tokyo Cabinet的Tokyo Cabinet 是一个DBM的实现。这里的数据库由一系列key-value对的记录构成。key和value都可以是任意长度的字节序列,既可以是二进制也可以是字符串。这里没有数据类型和数据表的概念。
作者叫Mikio Hirabayashi.Tokyo Cabinet是用C写的，同时提供c,perl,ruby,java的API。Tokyo Cabinet在提供了POSIX和C99的平台上都可用，它以GNU Lesser Public License协议发布。-Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.Tokyo Cabinet is written in the C language, and provided as API of C, Perl, Ruby, Java, and Lua. Tokyo Cabinet is available on platforms which have API conforming to C99 and POSIX. Tokyo Cabinet is a free
software licensed under the GNU Lesser General Public License.
Platform: |
Size: 893952 |
Author: ws |
Hits:
Description: 自己上学时写的Btree算法，处理基于Rot语言的图形，存储一些RFID的数据-Implements a B-Tree structure as introduced in the lecture to store the information read by the RFID readers in the library.
Platform: |
Size: 8192 |
Author: fang kun |
Hits:
Description: B+ tree insertion animation applet
Platform: |
Size: 28672 |
Author: chandan |
Hits:
Description: 实现了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
Platform: |
Size: 7168 |
Author: MiReDo |
Hits:
Description: B+树，用JAVA语句实现了一个B+树，包括B+树的构成，B+树的增删查改-B+ tree, using JAVA statement to achieve a B+ tree, including the composition of B+ tree, B+ tree of additions and deletions to change search
Platform: |
Size: 17408 |
Author: evaplum |
Hits:
Description: 这是 kyoko cabinet C 代码有关 Java 的绑定接口。
kyoko cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表和b树组织。
-Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
The following access methods are provided to the database: storing a record with a key and a value, deleting a record by a key, retrieving a record by a key. Moreover, traversal access to every key are provided. These access methods are similar to ones of the original DBM (and its followers: NDBM and GDBM) library defined in the UNIX standard. Kyoto Cabinet is an alternative for the DBM because of its higher performance.
Each operation of the hash database has the time complexity of "O(1)". Therefore, in theory, the performance is constant regardless of t
Platform: |
Size: 105472 |
Author: Jim Abuma |
Hits:
Description: Tokyo cabinet C 库代码的Java绑定接口。
Tokyo cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表、b树和定长数据组织。-The Tokyo Cabinet C libaray s Java binding.
Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.
Platform: |
Size: 180224 |
Author: Jim Abuma |
Hits:
Description: how to make B-tree for databases written in java
Platform: |
Size: 72704 |
Author: Ahmad Abushakra |
Hits: