summaryrefslogtreecommitdiffstats
path: root/database/bdb/DETAILS
diff options
context:
space:
mode:
Diffstat (limited to 'database/bdb/DETAILS')
-rwxr-xr-xdatabase/bdb/DETAILS20
1 files changed, 20 insertions, 0 deletions
diff --git a/database/bdb/DETAILS b/database/bdb/DETAILS
new file mode 100755
index 0000000000..c58edd449f
--- /dev/null
+++ b/database/bdb/DETAILS
@@ -0,0 +1,20 @@
+ SPELL=bdb
+ VERSION=0.5.4
+ SOURCE=$SPELL-$VERSION.tar.gz
+SOURCE_DIRECTORY=$BUILD_DIRECTORY/$SPELL-$VERSION
+ SOURCE_URL[0]=ftp://moulon.inra.fr/pub/ruby/$SOURCE
+ MD5[0]=f3187c669c10a830fd4013326212da23
+ WEB_SITE=http://moulon.inra.fr/ruby/bdb.html
+ ENTERED=20041207
+ UPDATED=20041207
+ LICENSE[0]=GPL
+ BUILD_API=2
+ SHORT="Berkeley DB is an embedded database system"
+cat << EOF
+Berkeley DB is an embedded database system that supports keyed access to data.
+
+The library includes support for the following access methods:
+ * B+tree: Stores keys in sorted order, using a default function that does lexicographical ordering of keys.
+ * Hashing: Stores records in a hash table for fast searches based on strict equality, using a default that hashes on the key as a bit string. Extended Linear Hashing modifies the hash function used by the table as new records are inserted, in order to keep buckets underfull in the steady state.
+ * Fixed and Variable-Length Records: Stores fixed- or variable-length records in sequential order. Record numbers may be immutable, requiring that new records be added only at the end of the database, or mutable, permitting new records to be inserted between existing records.
+EOF