Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Fix missing "is" in the query planner document. |
|---|---|
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA1: |
200941601a207b1f2ff23c001b64694e |
| User & Date: | drh 2013-12-12 14:10:48 |
Context
|
2013-12-14
| ||
| 12:40 | Add a change log for version 3.8.3. Fix a typo in the FAQ. check-in: 0aa5202f33 user: drh tags: trunk | |
|
2013-12-12
| ||
| 14:10 | Fix missing "is" in the query planner document. check-in: 200941601a user: drh tags: trunk | |
| 13:23 | Corrections to the spellfix1 documentation. check-in: aa19d1fdb5 user: drh tags: trunk | |
Changes
Changes to pages/queryplanner.in.
215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 |
to repeat the process for next fruit='Orange' entry. Advancing to the next row of an index (or table) is much less costly than doing a binary search since the next row is often located on the same database page as the current row. In fact, the cost of advancing to the next row is so cheap in comparison to a binary search that we usually ignore it. So our estimate for the total cost of this query is 3 binary searches. If the number of rows of output is K and the number of rows in the table is N, then in general the cost of doing the query proportional to (K+1)*logN. </p> <h3>1.5 Multiple AND-Connected WHERE-Clause Terms</h3> <p> Next, suppose that you want to look up the price of not just any orange, |
| |
215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 |
to repeat the process for next fruit='Orange' entry. Advancing to the
next row of an index (or table) is much less costly than doing a binary
search since the next row is often located on the same database page as
the current row. In fact, the cost of advancing to the next row is so
cheap in comparison to a binary search that we usually ignore it. So
our estimate for the total cost of this query is 3 binary searches.
If the number of rows of output is K and the number of rows in the table
is N, then in general the cost of doing the query is proportional
to (K+1)*logN.
</p>
<h3>1.5 Multiple AND-Connected WHERE-Clause Terms</h3>
<p>
Next, suppose that you want to look up the price of not just any orange,
|