Disk Based HashTables
Disk based hashes is a method to create multidimensional binary trees on disk. This library permits the extension of the database concept to a plethora of electronic data, such as graphical information.
| Licenses | LGPL QPL |
|---|
Recent releases
- 24 May 2006 14:26
Changes: The version number has been modified to follow the xffm scheme, since the package is now also distributed as part of xffm (xffm.sf.net). The dependency on xfce-dev-tools has been removed, and the make process cleaned up.
- 16 Mar 2004 21:06
Changes: In this version, if opening a file fails because the file is not a DBH file, or has been corrupted, exit(1) is no longer issued. Instead NULL is returned, so that it is now up to the application to decide what to do.
- 29 Aug 2003 23:04
Changes: Some missing files were included and packaging issues were fixed.
- 27 Aug 2003 23:58
Changes: Minor changes were made to the RPM spec file - "gcc" is no longer required, and comments were added for direct packagers for creating RPMs on systems not yet using libtool 1.5.
- 21 Jul 2003 09:50
Changes: This release adds fixes to the build process to enable easier RPM builds.
- All comments
Recent commentsHow does DBH differ from any other b?tree or disk-hash system?
Specifically, I'm wondering what distinguishes this project from the somewhat more mature Berkeley DB, GNU DBM, and other persistent-key-value-pair libraries?