Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Do not use an index fullscan for an UPDATE or DELETE or if disabled by sqlite3_test_control() or sqlite3_config(). |
|---|---|
| Downloads: | Tarball | ZIP archive | SQL archive |
| Timelines: | family | ancestors | descendants | both | nextgen-query-plan-exp |
| Files: | files | file ages | folders |
| SHA1: |
fabb21854e662b1d8e5631e79f828d53 |
| User & Date: | drh 2013-06-03 19:17:40 |
Context
|
2013-06-03
| ||
| 20:46 | Pull in recent trunk changes. Fix the ORDER BY optimizer so that it is better able to deal with COLLATE clauses. Clean up ambiguities in the descidx1.test script. (check-in: 6bc71dfc user: drh tags: nextgen-query-plan-exp) | |
| 19:17 | Do not use an index fullscan for an UPDATE or DELETE or if disabled by sqlite3_test_control() or sqlite3_config(). (check-in: fabb2185 user: drh tags: nextgen-query-plan-exp) | |
| 19:01 | Resolve ambiguities in test cases in collate2.test. (check-in: dcbbcb2e user: drh tags: nextgen-query-plan-exp) | |
Changes
Changes to src/where.c.
4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 |
if( x<BMS-1 ){
m &= ~(((Bitmask)1)<<x);
}
}
pNew->wsFlags = (m==0) ? (WHERE_IDX_ONLY|WHERE_INDEXED) : WHERE_INDEXED;
/* Full scan via index */
if( (m==0 || b) && pProbe->bUnordered==0 ){
pNew->iSortIdx = b ? iSortIdx : 0;
pNew->nOut = rSize;
pNew->rRun = (m==0) ? (rSize + rLogSize)*(1+b) : (rSize*rLogSize);
rc = whereLoopInsert(pBuilder, pNew);
if( rc ) break;
}
}
|
> | > > > > |
4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 |
if( x<BMS-1 ){
m &= ~(((Bitmask)1)<<x);
}
}
pNew->wsFlags = (m==0) ? (WHERE_IDX_ONLY|WHERE_INDEXED) : WHERE_INDEXED;
/* Full scan via index */
if( (m==0 || b)
&& pProbe->bUnordered==0
&& (pBuilder->pWC->wctrlFlags & WHERE_ONEPASS_DESIRED)==0
&& sqlite3GlobalConfig.bUseCis
&& OptimizationEnabled(pBuilder->pParse->db, SQLITE_CoverIdxScan)
){
pNew->iSortIdx = b ? iSortIdx : 0;
pNew->nOut = rSize;
pNew->rRun = (m==0) ? (rSize + rLogSize)*(1+b) : (rSize*rLogSize);
rc = whereLoopInsert(pBuilder, pNew);
if( rc ) break;
}
}
|