summaryrefslogtreecommitdiffstats
path: root/ruby-raa/bdb/DETAILS
diff options
context:
space:
mode:
Diffstat (limited to 'ruby-raa/bdb/DETAILS')
-rwxr-xr-xruby-raa/bdb/DETAILS13
1 files changed, 10 insertions, 3 deletions
diff --git a/ruby-raa/bdb/DETAILS b/ruby-raa/bdb/DETAILS
index ac1da847f1..d4fef2e65d 100755
--- a/ruby-raa/bdb/DETAILS
+++ b/ruby-raa/bdb/DETAILS
@@ -14,7 +14,14 @@ 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.
+ * 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