Home
last modified time | relevance | path

Searched refs:cost (Results 1 – 25 of 28) sorted by relevance

12

/sqlite-3.40.0/test/
H A Dfuzzer1.test68 INSERT INTO f1_rules(cfrom, cto, cost) VALUES('e','a',1);
232 INSERT INTO f2_rules(ruleset,cFrom,cTo,cost)
234 INSERT INTO f2_rules(ruleset,cFrom,cTo,cost)
236 INSERT INTO f2_rules(ruleset,cFrom,cTo,cost)
238 INSERT INTO f2_rules(ruleset,cFrom,cTo,cost)
1580 } {1 {fuzzer: cost must be between 1 and 1000}}
1589 } {1 {fuzzer: cost must be between 1 and 1000}}
1598 } {1 {fuzzer: cost must be between 1 and 1000}}
1675 CREATE TABLE x3_rules(rule_set, cFrom, cTo, cost);
1711 CREATE INDEX i1 ON x3_rules(cost);
[all …]
H A Dbestindex2.test32 # "=" constraints (but no others) may be optimized. The cost of a full table
35 # "WHERE 1" "cost 1000000 rows 1000000"
37 # If one or more "=" constraints are in use, the cost and estimated number
41 # "WHERE a=? AND b=?" -> "cost 900 rows 900"
42 # "WHERE c=? AND b<?" -> "cost 1000 rows 1000"
69 return "cost 1000000 rows 1000000"
71 set cost [expr (11-$nCons) * 1000]
72 set ret [concat $used "cost $cost rows $cost"]
H A Dfuzzer2.test38 CREATE TABLE x1_rules(ruleset, cFrom, cTo, cost);
43 set cost 1
49 db eval {INSERT INTO x1_rules VALUES(0, $c1||$c2, $c3||$c4, $cost)}
50 set cost [expr ($cost%1000) + 1]
55 db eval {UPDATE x1_rules SET cost = 20 WHERE cost<20 AND cFrom!='xx'}
69 ORDER BY cost asc, rowid asc LIMIT 9;
H A Dbestindex5.test52 set cost 1000000.0
65 set cost [expr $cost / 2]
71 set cost [expr $cost / 2]
77 lappend ret cost $cost
102 return [list cost 999999.0]
230 return [list cost 999999.0]
H A Dbestindex1.test40 return "omit 0 cost 0 rows 1 idxnum 555 idxstr eq!"
42 return "cost 1000000 rows 0 idxnum 0 idxstr scan..."
96 return [list omit $idx rows 10 cost 10 idxstr $SQL_FILTER]
99 return [list use $idx rows 10 cost 10 idxstr $SQL_FILTER]
102 return [list use $idx rows 10 cost 10 idxstr $SQL_SCAN]
304 set ret "cost 1000000 idxnum 555"
H A DwhereF.test19 # Assume there are two tables being joined - t1 and t2. Each has a cost
20 # if it is the outer loop, and a cost if it is the inner loop. As follows:
22 # t1(outer) - cost of scanning t1 as the outer loop.
23 # t1(inner) - cost of scanning t1 as the inner loop.
24 # t2(outer) - cost of scanning t2 as the outer loop.
25 # t2(inner) - cost of scanning t2 as the inner loop.
28 # cost of the join query is one of:
H A Dfuzzerfault.test24 CREATE TABLE x1_rules(ruleset, cFrom, cTo, cost);
48 CREATE TABLE x2_rules(ruleset, cFrom, cTo, cost);
71 CREATE TABLE x1_rules(ruleset, cFrom, cTo, cost);
H A Dbestindex4.test76 lappend ret cost $score rows $score
150 return [list omit 0 idxnum 555 rows 10 cost 100]
152 return [list cost 100000000]
H A Dbestindex3.test58 lappend ret cost 1000000 rows 1000000
60 lappend ret cost 100 rows 10
H A Dtkt2643.test18 # making bad assumptions about index cost when data from ANALYZE
H A Dtkt3757.test12 # Ticket #3757: The cost functions on the query optimizer for the
H A Danalyze6.test57 # The lowest cost plan is to scan CAT and for each integer there, do a single
H A Dcost.test15 set testprefix cost
H A Daltertab.test527 return "omit 0 cost 0 rows 1 idxnum 555 idxstr eq!"
529 return "cost 1000000 rows 0 idxnum 0 idxstr scan..."
H A Dmisc7.test259 # as the cost of a scan (greater than SQLITE_BIG_DOUBLE in the code).
H A Dskipscan1.test212 # Make sure skip-scan cost computation in the query planner takes into
H A Dfts3aux1.test386 # tables. And that fts4aux provides reasonably sane cost information via
H A Dautoindex1.test431 # cost estimate for automatic indexes on views and subqueries.
H A Dfts3ac.test476 grant refunds plus interest on the difference between cost-based rates and
760 In addition, please find out what a buy-out of VEPCO would cost us. With Rogers transitioning to …
H A Dfts2c.test476 grant refunds plus interest on the difference between cost-based rates and
760 In addition, please find out what a buy-out of VEPCO would cost us. With Rogers transitioning to …
H A Dfts1c.test476 grant refunds plus interest on the difference between cost-based rates and
760 In addition, please find out what a buy-out of VEPCO would cost us. With Rogers transitioning to …
H A DwhereJ.test332 # Ensure that the sorting cost does not swamp the loop costs and cause
/sqlite-3.40.0/src/
H A Dtest8.c818 double cost = 0; in echoBestIndex() local
834 cost = atof(Tcl_GetVar(interp, "echo_module_cost", TCL_GLOBAL_ONLY)); in echoBestIndex()
941 pIdxInfo->estimatedCost = cost; in echoBestIndex()
H A Dsqlite.h.in7135 ** ^The estimatedCost value is an estimate of the cost of a particular
7136 ** strategy. A cost of N indicates that the cost of the strategy is similar
7137 ** to a linear scan of an SQLite table with N rows. A cost of log(N)
7195 double estimatedCost; /* Estimated cost of using this index */
/sqlite-3.40.0/
H A Dmanifest908 F test/cost.test b11cdbf9f11ffe8ef99c9881bf390e61fe92baf2182bad1dbe6de59a7295c576

12