Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Changes In Branch exp-begin-concurrent-pnu Excluding Merge-Ins
This is equivalent to a diff from af17432e to 350f29ea
2018-07-12
| ||
19:39 | Merge latest begin-concurrent changes with this branch. (check-in: d33527d2 user: dan tags: begin-concurrent-pnu) | |
2018-07-10
| ||
15:55 | Experimental planner change to avoid a skip-scan if a regular index scan on the same index columns can be done instead. (Leaf check-in: 350f29ea user: dan tags: exp-begin-concurrent-pnu) | |
15:48 | Merge begin-concurrent changes into this branch. (check-in: af17432e user: dan tags: begin-concurrent-pnu) | |
15:45 | Merge latest trunk changes into this branch. (check-in: e9a3e864 user: dan tags: begin-concurrent) | |
2018-07-04
| ||
14:28 | Experimental planner change to avoid a skip-scan if a regular index scan on the same index columns can be done instead. (Leaf check-in: 32924446 user: dan tags: exp-avoid-expensive-skipscan) | |
2018-06-06
| ||
17:12 | Merge the 3.24.0 changes plus a few subsequent enhancements. (check-in: be7004a9 user: drh tags: begin-concurrent-pnu) | |
Changes to src/where.c.
︙ | |||
2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 | 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 | + + + + + + + + + + + + + + + + + + + + + + + | if( (p->prereq & pTemplate->prereq)==p->prereq /* (1) */ && p->rSetup<=pTemplate->rSetup /* (2a) */ && p->rRun<=pTemplate->rRun /* (2b) */ && p->nOut<=pTemplate->nOut /* (2c) */ ){ return 0; /* Discard pTemplate */ } /* If pTemplate: ** ** (1) uses the same index as existing where-loop p, ** (2) requires the same or a superset of tables to be scanned first, ** (3) constraints the same or fewer columns with ==, and ** (4) skips more leading columns (skip-scan optimization). ** ** the discard the template. This ensures that if stat4 data shows that: ** ** WHERE (a=1 AND b=2) ** ** is prohibitively expensive the planner does not instead do: ** ** WHERE (ANY(a) AND b=2) */ if( pTemplate->nSkip>p->nSkip /* (4) */ && pTemplate->u.btree.pIndex==p->u.btree.pIndex /* (1) */ && pTemplate->u.btree.nEq<=p->u.btree.nEq /* (3) */ && (pTemplate->prereq & p->prereq)==p->prereq /* (2) */ ){ return 0; /* Discard pTemplate */ } /* If pTemplate is always better than p, then cause p to be overwritten ** with pTemplate. pTemplate is better than p if: ** (1) pTemplate has no more dependences than p, and ** (2) pTemplate has an equal or lower cost than p. */ if( (p->prereq & pTemplate->prereq)==pTemplate->prereq /* (1) */ |
︙ |
Added test/analyzeG.test.
|