summaryrefslogtreecommitdiff
path: root/databases/dbh/DESCR
diff options
context:
space:
mode:
authorhubertf <hubertf@pkgsrc.org>2003-04-06 13:45:39 +0000
committerhubertf <hubertf@pkgsrc.org>2003-04-06 13:45:39 +0000
commitfcafcd14c9357ac01eda31b1194df59fbadae8bb (patch)
tree180143aab63e2439d9e7e80e6b947b512c75ba1b /databases/dbh/DESCR
parentfa9d267e476aecc6902884805b79b4562eb785d9 (diff)
downloadpkgsrc-fcafcd14c9357ac01eda31b1194df59fbadae8bb.tar.gz
Import dbh-1.0.14: Library to create disk based Hashtables
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. Submitted by benedikt.meurer@unix-ag.uni-siegen.de in pkgsrc-wip
Diffstat (limited to 'databases/dbh/DESCR')
-rw-r--r--databases/dbh/DESCR7
1 files changed, 7 insertions, 0 deletions
diff --git a/databases/dbh/DESCR b/databases/dbh/DESCR
new file mode 100644
index 00000000000..98a2c1ea744
--- /dev/null
+++ b/databases/dbh/DESCR
@@ -0,0 +1,7 @@
+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.