From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing  
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.


Based on what I can find on the web, it appears that dbm is the correct capitalisation. Should this article be using {{lowercase}}? John Vandenberg 08:38, 20 February 2007 (UTC)

links to sleepycat in references are broken. just put a note next to the link -- perhaps somebody can find an alternative source?

"offer speed since queries aren't involved" ... Queries has nothing to do with database engines in general among different db engines.[edit]

Database engines don't use queries. There's a layer above the engines that handles the queries and invokes the db engine. dbm is mor of a db engine?

From this article: "While dbm and its derivatives are pre-relational databases — effectively a hash fixed to disk — in practice they can offer a more practical solution for high-speed storage looked up by-key as they do not require the overhead of connecting and preparing queries. This is balanced by the fact that they can generally only be opened for writing by a single process at a time. While this can be addressed by the use of an agent daemon which can receive signals from multiple processes, this does, in practice, add back some of the overhead."

(?) Should be removed or written here about db engines in general, which in turn has explanatory value for this article. — Preceding unsigned comment added by (talk) 06:35, 26 June 2012 (UTC)


How can the list of "successors" be anything but a bunch of links to alternatives? How many in the list are actually derived from the original dbm code? twimoki (talk) 15:51, 4 December 2012 (UTC)

dbm (e.g. sdbm) databases used for indexing to flat file database, fixed-length record offsets[edit]

Nothing was said in the article about "Joint Database Technology"? Why not?

Fixed-Length Record, Flat File Databases an be used to store large amounts of data, with large records, and work in tandem with program Hash Tables tied to Persistent dbm (e.g. sdbm) database files used as indexes to Fixed-Length Record offsets (in bytes) within Flat File Databases - for very speedy random access lookups.

Example, a 4 Gigabyte flat file containing 5 million fixed-length records (no field or record delimiters) can be indexed using dbm (e.g. sdbm) database files of key/value pairs, where the value is the location offset (in bytes) to any record in the flat file. The key is a flat file field, partial field, or combination of multiple fields. Random access lookup times to any record (by the record offset) are instantaneous. Erichansen1836 (talk) 17:30, 4 April 2015 (UTC)