Disk Based HashTables 5.0.7

A method to create multidimensional binary trees on disk
Disk Based HashTables is a method to create multidimensional binary trees on disk.

What's a disk based hashtable? A DBH is a convenient way to associate keys composed by characters to data records. Any kind of digital information can go into the data record, such as text, graphic information, database structures, you name it. The idea behind using a DBH is to get rid of what is known as an index file in the database world. In the DBH world, the index is built into the file format.

What's wrong with using GhashTables? Nothing, absolutely. But GhashTables (from the GNU glib library) works fine for hashtables that reside in memory, not disk. There is a size limitation in this respect to GhashTables. But the combination of GhashTables and DBhashTables is a powerfull thing indeed.

Why should I use DBH? If you need to have large quantities of information available online, and with obsolete equipment you require better performance than that available with expensive proprietary databases, then DBH is for you.

When should I not use DBH? If you wish to use a large database problem as a means to justify the purchase of expensive state of the art hardware and proprietary software, stay clear of DBH. Don't even mention it.

last updated on:
July 19th, 2013, 9:48 GMT
license type:
QPL (QT Public License) 
developed by:
Edscott Wilson Garcia
ROOT \ Utilities
Disk Based HashTables
Download Button

In a hurry? Add it to your Download Basket!

user rating



Rate it!
What's New in version 5.0.6
  • This version adds the dbh_foreach() function, which allows smoother operation within a threaded environment.
read full changelog

Add your review!