Disk Based HashTables
Disk Based HashTables
- Downloads: 181
- Requirements:
- Size:
- Licence:
- Version: 5.0.7
- Added At: 2013-20-07
- Publisher Site:
Disk Based HashTables
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 equipm
Soft85 only provide legal software, please help us keeping pur site legal, if you think this page is violating copyrights please let us know by clicking here Here