diff options
| author | mef <mef> | 2015-01-19 02:07:41 +0000 |
|---|---|---|
| committer | mef <mef> | 2015-01-19 02:07:41 +0000 |
| commit | 30f5bd4a72ff218ea51d8fa3bb3b108bac58064b (patch) | |
| tree | 9067fc6d24198f42ddcce677ad6aba20a6841379 /databases/libdbh2/DESCR | |
| parent | 2b353efd1d8caa5c41dc018c69decff366245be7 (diff) | |
| download | pkgsrc-30f5bd4a72ff218ea51d8fa3bb3b108bac58064b.tar.gz | |
This is successor of databases/dbh. See
http://mail-index.netbsd.org/pkgsrc-users/2015/01/15/msg020923.html
Import libdbh2-5.0.16 as databases/libdbh2.
Disk based hashes is a method to create multidimensional binary trees on disk.
This library permits the extension of database concept to a plethora of
electronic data, such as graphic information. With the multidimensional binary
tree it is possible to mathematically prove that access time to any
particular record is minimized (using the concept of critical points from
calculus), which provides the means to construct optimized databases for
particular applications.
(From: doc/html/DBH.html)
Disk Based Hashtables (DBH) 64 bit ? Library to create and manage hash
tables residing on disk. Associations are made between keys and values
so that for a given a key the value can be found and loaded into memory
quickly. Being disk based allows for large and persistent hashes. 64 bit
support allows for hashtables with sizes over 4 Gigabytes on 32 bit
systems. Quantified key generation allows for minimum access time on
balanced multidimensional trees.
Diffstat (limited to 'databases/libdbh2/DESCR')
| -rw-r--r-- | databases/libdbh2/DESCR | 16 |
1 files changed, 16 insertions, 0 deletions
diff --git a/databases/libdbh2/DESCR b/databases/libdbh2/DESCR new file mode 100644 index 00000000000..8449ad1c9ce --- /dev/null +++ b/databases/libdbh2/DESCR @@ -0,0 +1,16 @@ +Disk based hashes is a method to create multidimensional binary trees on disk. +This library permits the extension of database concept to a plethora of +electronic data, such as graphic information. With the multidimensional binary +tree it is possible to mathematically prove that access time to any +particular record is minimized (using the concept of critical points from +calculus), which provides the means to construct optimized databases for +particular applications. + +(From: doc/html/DBH.html) +Disk Based Hashtables (DBH) 64 bit ? Library to create and manage hash +tables residing on disk. Associations are made between keys and values +so that for a given a key the value can be found and loaded into memory +quickly. Being disk based allows for large and persistent hashes. 64 bit +support allows for hashtables with sizes over 4 Gigabytes on 32 bit +systems. Quantified key generation allows for minimum access time on +balanced multidimensional trees. |