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
Spire.PDF for Java 2.7.8
Database Workbench Pro 5.6.10.0
The C# PDF Library 2020.1.5
CAD-Viewer 3DVBVIEW V4
dotConnect for SQLite 5.15
LuaStudio 9.92
EntityDAC 2.3
Devart ODBC Driver for QuickBooks 2.0
phpEnter 5.1.
Udemy Clone script 2.01
VisualNEO Web 19.11.7
VisualNEO for Windows 19.4.29.0
SentiVeillance SDK Trial 7.3
Devart ODBC Driver for PostgreSQL 3.2
SecureBridge 9.2
Top Code
SecureBridge 8.0
dotConnect for SQLite 5.9
EntityDAC 1.6
Database Workbench Pro 5.6.10.0
ATN Site Builder 3.0
ATN Resume Finder 2.0
PHP Review Script 1.0
Devart ODBC Driver for PostgreSQL 3.2
ADO.NET Provider for ExactTarget 1.0
Deals and Discounts Website Script 1.0.2
ICPennyBid Penny Auction Script 4.0
Invoice Manager by PHPJabbers 3.0
The C# PDF Library 1.0
Aglowsoft SQL Query Tools 8.2
Classified Ad Lister 1.0
Top Rated
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
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
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
QDBM 1.8.75
File ID: 76046






QDBM 1.8.75
Download QDBM 1.8.75http://tokyocabinet.sourceforge.netReport Error Link
License: Freeware
File Size: 921.6 KB
Downloads: 37
Submit Rating:
QDBM 1.8.75 Description
Description: QDBM is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table or B tree.
As for database of hash table, each key must be unique within a database, so it is impossible to store two or more records with a key overlaps. The following access methods are provided to the database: storing a record with a key and a value, deleting a record by a key, retrieving a record by a key. Moreover, traversal access to every key are provided, although the order is arbitrary. These access methods are similar to ones of DBM (or its followers: NDBM and GDBM) library defined in the UNIX standard. QDBM is an alternative for DBM because of its higher performance.
As for database of B tree, records whose keys are duplicated can be stored. Access methods of storing, deleting, and retrieving are provided as with the database of hash table. Records are stored in order by a comparing function assigned by a user. It is possible to access each record with the cursor in ascending or descending order. According to this mechanism, forward matching search for strings and range search for integers are realized. Moreover, transaction is available in database of B tree.

License: Freeware

Related: Database, Record, Access, methods, provided, Records, Table, Order, Search, Storing, Deleting, Library, stored, retrieving, Managing, duplicated, qdbm 1 8 75

O/S:BSD, Linux

File Size: 921.6 KB

Downloads: 37



More Similar Code

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.



WIN32 Port of Tokyo Cabinet, 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.



QLink is a small tool based on Mathlink and the QDBM (http://qdbm.sourceforge.net/) database that allows to use the database directly from Wolfram Mathematica. With the help of QLink one can avoid the operative memory restriction.

User Review for QDBM
- required fields
     

Please enter text on the image