Documentation Source Text

Check-in [ea35f76f95]
Login

Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

Overview
Comment:Fix a broken fragment specification in the fileformat page.
Downloads: Tarball | ZIP archive
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA1: ea35f76f95b7110631f74847cb89542f2f111cc5
User & Date: drh 2013-11-09 17:17:01.353
Context
2013-11-09
17:27
Tweaks to WITHOUT ROWID documentation. (check-in: 478a586d67 user: drh tags: trunk)
17:17
Fix a broken fragment specification in the fileformat page. (check-in: ea35f76f95 user: drh tags: trunk)
17:14
Add the WITHOUT ROWID document. Enhance the file-format, CREATE TABLE, and AUTOINCREMENT documents to reflect changes due to WITHOUT ROWID. (check-in: ffe4c464ea user: drh tags: trunk)
Changes
Unified Diff Ignore Whitespace Patch
Changes to pages/fileformat2.in.
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443

<p>^The number of freelist pages is stored as a 4-byte big-endian integer
in the database header at an offset of 36 from the beginning of the file.
^The database header also stores the page number of the first freelist trunk
page as a 4-byte big-endian integer at an offset of 32 from the beginning
of the file.</p>

<tcl>hd_fragment btree {B-Trees} {B*-Trees}</tcl>
<h3>1.5 B-tree Pages</h3>

<p>The b-tree algorithm provides key/data storage with unique and
ordered keys on page-oriented storage devices.
For background information on b-trees, see
Knuth, <u>The Art Of Computer Programming</u>, Volume 3 "Sorting
and Searching", pages 471-479.  Two kinds of b-trees are used by







|







429
430
431
432
433
434
435
436
437
438
439
440
441
442
443

<p>^The number of freelist pages is stored as a 4-byte big-endian integer
in the database header at an offset of 36 from the beginning of the file.
^The database header also stores the page number of the first freelist trunk
page as a 4-byte big-endian integer at an offset of 32 from the beginning
of the file.</p>

<tcl>hd_fragment btree {B*-Trees}</tcl>
<h3>1.5 B-tree Pages</h3>

<p>The b-tree algorithm provides key/data storage with unique and
ordered keys on page-oriented storage devices.
For background information on b-trees, see
Knuth, <u>The Art Of Computer Programming</u>, Volume 3 "Sorting
and Searching", pages 471-479.  Two kinds of b-trees are used by