[RPM] cooker contrib/release tokyocabinet-1.4.23-1mdv2010.0
Mandriva Linux: changelog@mandrivalinux.org
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
- From: Frederik Himpe
- Subject: [RPM] cooker contrib/release tokyocabinet-1.4.23-1mdv2010.0
- Date: Sat, 30 May 2009 21:40:59 +0200 (CEST)
Name : tokyocabinet Relocations: (not relocatable) Version : 1.4.23 Vendor: Mandriva Release : 1mdv2010.0 Build Date: Sat May 30 20:51:35 2009 Install Date: (not installed) Build Host: n2.mandriva.com Group : System/Libraries Source RPM: (none) Size : 918447 License: LGPL Signature : (none) Packager : Frederik Himpe <fhimpe@> URL : http://tokyocabinet.sourceforge.net/ Summary : Tokyo Cabinet: a modern implementation of DBM Description : Tokyo Cabinet 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. Tokyo Cabinet 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 comparison 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. Tokyo Cabinet is written in the C language, and provided as API of C, Perl, Ruby, and Java. Tokyo Cabinet is available on platforms which have API conforming to C99 and POSIX. Tokyo Cabinet is a free software licensed under the GNU Lesser General Public License. Frederik Himpe <fhimpe@> 1.4.23-1mdv2010.0: + Revision: 381527 - update to new version 1.4.23
- Prev by Date: [RPM] cooker contrib/release qtads-1.8-2mdv2010.0
- Next by Date: [RPM] 2009.0 contrib/updates qtads-1.8-2mdv2009.0
- Previous by thread: [RPM] cooker contrib/release qtads-1.8-2mdv2010.0
- Next by thread: [RPM] 2009.0 contrib/updates qtads-1.8-2mdv2009.0
- Index(es):
