Lines Matching full:scan
4750 ** particular lookup. A full scan of a table with N entries should have
5642 ** that the prepared statement is using a full table scan rather than
5669 ** a table as part of a full table scan. Large numbers for this counter
43777 ** keep entries in the disk file in order so that a scan
43778 ** of the table is a linear scan through the file. That
47630 ** the label is resolved to a specific address, the VDBE will scan
51835 ** ALGORITHM: Scan the input string looking for host parameters in any of
51966 ** Various scripts scan this source file in order to generate HTML
53145 ** Formatting is important to scripts that scan this file.
54663 /* Scan the header and use it to fill in the u.am.aType[] and u.am.aOffset[]
59921 ExprList *pEList, /* List of expressions to scan */
67460 ** Scan the column type name zType (length nType) and return the
69067 /* Scan the names of the columns of the table to be indexed and
70753 SrcList *pSrc, /* the FROM clause -- which tables to scan */
70983 /* The usual case: There is a WHERE clause so we have to scan through
71004 ** database scan. We have to delete items after the scan is complete
71005 ** because deleting an item can change the scan order. */
73251 SrcList *pSrc, /* SrcList containing the table to scan */
73261 Expr *pWhere = 0; /* WHERE clause to scan with */
73312 /* If the child table is the same as the parent table, and this scan
73314 ** row being deleted from the scan by adding ($rowid != rowid) to the WHERE
79282 SrcList *pSrc, /* the FROM clause -- which tables to scan */
79905 ** of the scan loop.
81124 ** of the scan loop.
81611 ** Scan through the expression pExpr. Replace every reference to
81657 ExprList *pList, /* List to scan and in which to make substitutes */
81717 ** but only has to scan the data once. And because indices might
81718 ** exist on the table t1, a complete scan of the data might be
82036 ** will scan expressions looking for iParent references and replace
82277 ** (4) Scan the list of columns in the result set (pEList) looking
82983 ** Begin the database scan
83003 /* End the database scan loop.
83281 const int iCsr = pParse->nTab++; /* Cursor to scan b-tree */
83293 ** will therefore be cheaper to scan to determine the query result.
85116 /* Begin the database scan
85131 /* End the database scan loop.
85452 /* Generate code to scan the ephemeral table and call VUpdate. */
86986 #define WHERE_REVERSE 0x02000000 /* Scan in reverse order */
88357 /* If there is an ORDER BY clause, increase the scan cost to account
88823 ** optimized by the proposed index scan. For example, assuming index p is
88836 ** value of 1 indicates that the proposed range scan is expected to visit
88839 ** that the range scan will visit every row (100%) selected by the equality
89026 int rev; /* True to scan in reverse order */
89031 ** scan being evaluated. They are then used to determine the expected
89142 ** naturally scan rows in the required order, set the appropriate flags
89144 ** will scan rows in a different order, set the bSort variable. */
89562 int bRev; /* True if we need to scan in reverse order */
89742 /* Case 3: A scan using an index.
89847 /* If we are doing a reverse order scan on an ascending index, or
89848 ** a forward order scan on a descending index, interchange the
89960 ** WHERE clause terms made redundant by the index range scan.
90071 WhereInfo *pSubWInfo; /* Info for single OR-term scan */
90110 ** scan of the entire table.
90251 ** If the WHERE clause is empty, the foreach loops must each scan their
90254 ** refer to those indices, a complete table scan can be avoided and the
90289 ** scan is correct for the ORDER BY clause, then that index is used and
90461 ** FROM clause entry that permits the lowest-cost, "optimal" scan. In
90462 ** this context an optimal scan is one that uses the same strategy
90468 ** The second iteration is only performed if no optimal scan strategies
90470 ** lowest cost scan overall.
90483 ** However, since the cost of a linear scan through table t2 is the same
90484 ** as the cost of a linear scan through table t1, a simple greedy
90545 ** used for the scan. If not, then query compilation has failed.
90808 /* If this scan uses an index, make code substitutions to read data
98848 #define FTS3_FULLSCAN_SEARCH 0 /* Linear scan of %_content table */
99415 ** 3. Linear scan of %_content table.
99422 /* By default use a full table scan. This is an expensive option,
100244 sqlite3_stmt *pStmt = 0; /* SQL statement to scan %_segdir table */
100273 ** create a Fts3SegReader to scan the single leaf.
100525 ** If idxNum==FTS3_FULLSCAN_SEARCH then do a full table scan against
100549 "SELECT * FROM %Q.'%q_content' WHERE docid = ?", /* non-full-table-scan */
100550 "SELECT * FROM %Q.'%q_content'", /* full-table-scan */
100570 /* Compile a SELECT statement for this cursor. For a full-table-scan, the
103057 /* Scan past delimiter characters */
103770 /* Scan past delimiter characters */
104822 Fts3HashElem **aElem = 0; /* Array of term hash entries to scan */
108233 ** record (i.e if the scan has finished), or zero otherwise.
108401 /* This "scan" is a direct lookup by rowid. There is no next entry. */
108520 /* Normal case - r-tree scan. Set up the RtreeCursor.aConstraint array
108569 ** table scan strategies to choose from (in order from most to
108576 ** 3 Unused Full table scan.
110036 rtreeFilter, /* xFilter - configure scan constraints */
