Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Magento Australia Post eParcel Extension 1.0
Airbnb Script - Airbnb Clone 1.0.3
Hotel Restaurant Reviews and Feedback Script 1.0.3
Documenter for MySQL 1.0
ODBC Driver for xBase 1.1
ODBC Driver for FreshBooks 2.0
AnyGantt JS Gantt Charts 8.4.2
The C# Barcode Library 4.0.2.2
ConyEdit for Windows 1.1.0
wolfSSL 3.15.5
Taxi Booking App Like Uber 1.0
IP2Location Geolocation Database 2018
Food Delivery Script 1.0.3
ODBC Driver for Magento 1.3
dbForge Studio for SQL Server 5.6
Top Code
Java-2-Pseudo 1.0
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
MCU 8051 IDE 1.4.7
My Cubic Splines 1.0
Ping Pong Game Code Script 1.1
GnuWin64 64
Food Delivery Script 1.0.3
School Management Script 1.0.4
Convert Arabic to Roman 1.0
rilt 1.0
Free Pageant Contest Source Code 1.0
iScripts NetMenus 2.0
Visual FoxPro Functions/Class Libary 100
Fourier
Social Network Script 3.0
Top Rated
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
PHP Digital Download Script 1.0.4
Implementation modified B-TREE 1.0
File ID: 114977






Implementation modified B-TREE 1.0
Download Implementation modified B-TREE 1.0http://implementationm.sourceforge.netReport Error Link
License: Freeware
Downloads: 114
Submit Rating:
Implementation modified B-TREE 1.0 Description
Description: this is a miniature of the C-ISAM library. Which is used to maintain, store and access records in a database system. I have modified the B-TREE used in this project, for my own project.

License: Freeware

Downloads: 114



More Similar Code

ZBit B+Tree is an ASP web based online database component which can be integrated into users website to collect the data in database with the help of COM object, which uses B+ Tree algorithm. This component has features like multithreaded datas, fast searching, deletion, updates, and insertion, control over duplicate keys, regular customizing of datas, easy handling of all elements, regular navigation of datas with in the structure and many...



Zebra_MPTT is a PHP class that provides an implementation of the modified preorder tree traversal algorithm making it easy for you to use MPTT in your PHP applications.

It provides methods for adding nodes anywhere in the tree, deleting...



ChaiDB is an embedded data storage developed at the kernel level by using B-Tree implementation. It is a natural database choice for name/value applications such as JSON. JSON-Cache utilizes ChaiDB to provide persistence and cache solution for...



B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.



kdtree provides a minimalistic implementation of kd-tree. The implementation can be used either inside MATLAB by means of MEX calls, or as a standalone tool, directly from a C/C++ program. The image on the website has been creaed with...



Implementation of a tree view with a list view, for windows API. The view is compatiple to the tree control of the common-contr. It allows to set colors and icons for each item. Homepage: http://members.inode.at/anton.zechner/az/TreeList.en.htm



Sometimes it can be hard to work out a way of efficiently representing a tree in the database. Combining modified preorder tree traversal with a parent child model allows most common queries to be represented in a single sql query. This example...



This is a short & sweet UUID function. Uniqueness is based on network address, time, and random.

Another good point: does not create a "hot spot" when used in a b-tree (database) index. In other words, if your IDs look...



Tokyo Cabinet is the successor of QDBM, a high performance database library similar to the DBM family. It also supports hash and B-tree databases and does not require any server process. The overall speed is improved compared to QDBM.



Java API to realize quick ISAM (Index Sequential Access Method) functionality for local application. This includes database files and scalable B+Tree (B-plus-tree) index files. Supports data backup and strong file encryption using Twofish and...

User Review for Implementation modified B-TREE
- required fields
     

Please enter text on the image