*** 15,21 **** GDBM only stores a single table per file, so a complete database consisted of a directory full of files - one file for each table and index. GDBM is based on hashing, so only exact key matches could be used on indices ! and inequality constraints required complete table scans. GDBM is does not support atomic transactions. And GDBM is released under the GPL which meant that SQLite could not be embedded in proprietary products. Because of these constraints, work was begun on a new B-Tree based backend for --- 15,21 ---- GDBM only stores a single table per file, so a complete database consisted of a directory full of files - one file for each table and index. GDBM is based on hashing, so only exact key matches could be used on indices ! and inequality constraints required complete table scans. GDBM does not support atomic transactions. And GDBM is released under the GPL which meant that SQLite could not be embedded in proprietary products. Because of these constraints, work was begun on a new B-Tree based backend for
Small. Fast. Reliable.
Choose any three.
Choose any three.
|
|