This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
标签： project implement developed Database
上传时间： 2013-12-25
上传用户：semi1981
Bing is a point-to-point bandwidth measurement tool (hence the b ), based on ping. Bing determines the real (raw, as opposed to available or average) throughput on a link by measuring ICMP echo requests roundtrip times for different packet sizes for each end of the link
标签： Bing point-to-point measurement determines
上传时间： 2015-09-15
上传用户：lgnf
* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.msstate.edu, Mississippi State University) * IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT * OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR" * HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
上传时间： 2015-09-24
上传用户：mpquest
EIA（ELECTRONIC INDUSTRIES ALLIANCE）标准文档EIA-CEA-861-B，A DTV Profile for Uncompressed High Speed Digital Interfaces。
标签： ELECTRONIC INDUSTRIES ALLIANCE EIA-CEA
上传时间： 2015-09-27
上传用户：hphh
基于事件驱动的串口通讯控件 消息帧数据格式: 1 0 A B X X 其中 10 为消息标识, AB表示文本长度,L=A*100+B XX为配位字符,任意 控制帧数据格式 0 1 A B M N 其中 01为控制标识, AB为请求标识 MN为附加标识 11表示请求对方接收文件,M表示描述字串中文件名子串的长度 N表示描述字串中文件大小子串的长度 10通知对方放弃传输 00通知文件传输完毕 01请求对方发送数据, MN为10请求发送下一个 MN为00请求重发 数据帧数据格式 0 0 A B M N 其中 00 为数据标识, AB表示数据长度,L=A*100+B MN为校验,M*100+N=A+B
上传时间： 2015-10-06
上传用户：拔丝土豆
考察例1 4 - 8中的1 4个点。A中的最近点对为(b,h)，其距离约为0 . 3 1 6。B中最近点对为 (f, j)，其距离为0 . 3，因此= 0 . 3。当考察 是否存在第三类点时，除d, g, i, l, m 以外 的点均被淘汰，因为它们距分割线x= 1的 距离≥ 。RA ={d, i, m}，RB= {g, l}，由 于d 和m 的比较区中没有点，只需考察i 即可。i 的比较区中仅含点l。计算i 和l 的距离，发现它小于，因此(i, l) 是最近
标签：
上传时间： 2013-12-03
上传用户：66666
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
标签： C. hamsterdb structure database
上传时间： 2013-12-11
上传用户：LouieWu
B树算法实现，非常难得！btree implementation for random lookups, transaction handling, sequential access methods, and a small embeddable footprint.
上传时间： 2014-01-10
上传用户：王小奇
B树及其B+树的实现代码，支持模版（数据类型，M值）
上传时间： 2016-02-22
上传用户：jhksyghr
高斯－塞德尔迭代法算法： 设方程组AX=b 的系数矩阵的对角线元素 ，M为迭代次数容许的最大值， 为容许误差。 ① 取初始向量 ，令k=0 ② 对 计算 ③ 如果 ，则输出 ，结束；否则执行④， ④ 如果 ，则不收敛，终止程序；否则 ，转②。
上传时间： 2014-01-22
上传用户：集美慧
