Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Fix a typo in the WITHOUT ROWID documentation. |
|---|---|
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA1: |
5725d732c94303679f75e029a92eadc9 |
| User & Date: | drh 2013-11-15 16:22:04 |
Context
|
2013-11-18
| ||
| 18:48 | Fix documentation typos pointed out on the mailing list by Philip Newton. check-in: b8e6ac4ce4 user: drh tags: trunk | |
|
2013-11-15
| ||
| 16:22 | Fix a typo in the WITHOUT ROWID documentation. check-in: 5725d732c9 user: drh tags: trunk | |
|
2013-11-13
| ||
| 22:39 | Update the change log to show the skip-scan optimization and other recent changes. Add documentation on skip-scan. check-in: 9b1dc53b75 user: drh tags: trunk | |
Changes
Changes to pages/withoutrowid.in.
181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 |
a single B-Tree, the text of the "word" column is only stored once in the
database. Furthermore, querying the "cnt" value for a specific "word"
only involves a single binary search into the main B-Tree, since the "cnt"
value can be retrieved directly from the record found by that first search
and without the need to do a second binary search on the rowid.
<p>Thus, in some cases, a WITHOUT ROWID table can use about half the amount
of disk space and can operation nearly twice as fast. Of course, in a
real-world schema, there will typically be secondary indices and/or
UNIQUE constraints, and the situation is more complicated. But even then,
there can often be space and performance advantages to using WITHOUT ROWID
on tables that have non-integer or composite PRIMARY KEYs.
<h2>4.0 When To Use WITHOUT ROWID</h2>
|
| |
181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 |
a single B-Tree, the text of the "word" column is only stored once in the
database. Furthermore, querying the "cnt" value for a specific "word"
only involves a single binary search into the main B-Tree, since the "cnt"
value can be retrieved directly from the record found by that first search
and without the need to do a second binary search on the rowid.
<p>Thus, in some cases, a WITHOUT ROWID table can use about half the amount
of disk space and can operate nearly twice as fast. Of course, in a
real-world schema, there will typically be secondary indices and/or
UNIQUE constraints, and the situation is more complicated. But even then,
there can often be space and performance advantages to using WITHOUT ROWID
on tables that have non-integer or composite PRIMARY KEYs.
<h2>4.0 When To Use WITHOUT ROWID</h2>
|