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
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 tree 實現(xiàn)代碼，可用于緩存數(shù)據(jù)，提高查詢速度
上傳時間： 2015-11-27
上傳用戶：it男一枚
B-tree 在內(nèi)存中的實現(xiàn)，包括插入、刪除、查找。
標簽： B-tree 內(nèi)存 中的實現(xiàn)
上傳時間： 2013-12-09
上傳用戶：asasasas
b tree code for index in the database design
標簽： database design index tree
上傳時間： 2016-02-03
上傳用戶：z1191176801
b+tree 的插入和查詢操作，代碼比較簡練，效率高。缺少刪除操作。
上傳時間： 2013-12-19
上傳用戶：lijinchuan
this is a Implementation of a B* tree,not yet completed, because I need help for this task.
標簽： this Implementation completed because
上傳時間： 2013-11-27
上傳用戶：xinyuzhiqiwuwu
數(shù)據(jù)結(jié)構(gòu)B-TREE的java實現(xiàn)，按照CLRS的思路描述，通過測試~
標簽： B-TREE java 數(shù)據(jù)結(jié)構(gòu)
上傳時間： 2013-12-11
上傳用戶：xinyuzhiqiwuwu
樣板 B 樹 ( B - tree ) 規(guī)則 : (1) 每個節(jié)點內(nèi)元素個數(shù)在 [MIN,2*MIN] 之間, 但根節(jié)點元素個數(shù)為 [1,2*MIN] (2) 節(jié)點內(nèi)元素由小排到大, 元素不重複 (3) 每個節(jié)點內(nèi)的指標個數(shù)為元素個數(shù)加一 (4) 第 i 個指標所指向的子節(jié)點內(nèi)的所有元素值皆小於父節(jié)點的第 i 個元素 (5) B 樹內(nèi)的所有末端節(jié)點深度一樣
上傳時間： 2017-05-14
上傳用戶：日光微瀾
b+ tree code implementation and insertion deletion
標簽： implementation insertion deletion tree
上傳時間： 2017-05-20
上傳用戶：來茴
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
