achieve m bands Containing tree (2) linear scale for the keys inserted into Cont...

企业信息管理系统包含信息录入，信息查询，信息统计等多项功能。-Enterprise Information Management System contains information input, information inquiry, information statistics and many other features.

用C语言写的文件合并，可以合并两个二进制文件-Using C language to write the file merger can merge two binary files

B＋树实现源码，JAVA语言，数据库索引技术-B+ Tree source, Java language, database indexing technology

About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl

用VB和matlab混合编程，编写的数据库，数据库包含有删除，添加，修改，插入 及查看等功能，在利用VB和SQL联系起来，由于matlab强大的算法功能，将输入各类数据进行用算后存入数据库。

连续和问题的啦 还不错的 没看过的一起来看-Continuous and the problem did not you also a good read together

SQL 语句帮助文件-SQL sentence help document

开源的数据库管理系统，采用 key－>value 方式，适用场合很多！绝对源码！-open-source database management system that uses key-gt; Value, applies many occasions! Absolute source!

ORACLE数据库得建表语句-ORACLE database built in Table statement

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of