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
* "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
基于B/S模式高校科研系统的设计与研究,基于B/S模式的高校科 研管理信息系统采用3层体系结构,利用ASP技术和SQL Server数据库系统加以设计与实现。
上传时间: 2013-12-26
上传用户:ma1301115706
Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A common approach to implementing these arithmetic functions is to use the Coordinate Rotation Digital Computer (CORDIC) algorithm. The CORDIC algorithm calculates the trigonometric functions of sine, cosine, magnitude, and phase using an iterative process. It is made up of a series of micro-rotations of the vector by a set of predetermined constants, which are powers of two. Using binary arithmetic, this algorithm essentially replaces multipliers with shift and add operations. In a Stratix™ device, it is possible to calculate some of these arithmetic functions directly, without having to implement the CORDIC algorithm.
标签: representation Magnitude the magnitude
上传时间: 2013-12-24
上传用户:金宜
该系统是基于J2EE框架的一个B/S的网上书店电子商务系统。采用B/S模式为企业提供强大的电子商务平台。实现对企业供产销系统的全面信息监控,同时提高整个网上书店的信息系统的安全性。通过WEB服务器使客户通过浏览器与服务器进行信息沟通。通过JDBC技术实现与数据库的动态挂接,提供的信息的鲜度,采用MVC模式提供系统的灵活性和可移植性,实现对网上书店的信息系统的全局信息监控和分析。运用O/R Mapping理论,使用Mysql数据库。本系统主要采用四个层次:视图层、业务逻辑层、ORM层,数据库层。含商品发布及管理子系统、订单子系统合物流子系统、以及综合管理系统。
上传时间: 2015-11-01
上传用户:ryb
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
ITU-T G.729语音压缩算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding of Speech at 8 kbit/s using Conjugate-Structure Algebraic-Code-Excited Linear-Prediction (CS-ACELP) with Voice Activity Decision(VAD), Discontinuous Transmission(DTX), and Comfort Noise Generation(CNG).
标签: description commendation Fixed-point 729
上传时间: 2014-11-23
上传用户:thesk123
B树算法实现,非常难得!btree implementation for random lookups, transaction handling, sequential access methods, and a small embeddable footprint.
上传时间: 2014-01-10
上传用户:王小奇
本书以奥地利贝加莱公司的B&R 2000系列可编程计算机控制器(PCC)为背景,系统地介绍了最新的可编程控制器的工作原理、指令系统、编程方法、网络通讯等,力求将这一领域的最新技术成果介绍给读者。
上传时间: 2016-01-25
上传用户:sevenbestfei
Floyd-Warshall算法描述 1)适用范围: a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述: a)初始化:dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结束:dis即为所有点对的最短路径矩阵 3)算法小结:此算法简单有效,由于三重循环结构紧凑,对于稠密图,效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。 考虑下列变形:如(I,j)∈E则dis[I,j]初始为1,else初始为0,这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的,我们可以把dis设成boolean类型,则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分,可以更直观地得到I,j的连通情况。
标签: Floyd-Warshall Shortest Pairs Paths
上传时间: 2013-12-01
上传用户:dyctj