This query plan shows a full table scan.
该查询计划显示了一个全表扫描。
Table scan (TBSCAN) with partition pruning.
使用分区修剪的表扫描(TBSCAN)。
This report query requires a full table scan of the fact table.
这个报表查询需要该事实表的一个全表扫描。
Indexes improve query performance by avoiding a full table scan.
索引能够避免全表扫描，从而能够提高查询性能。
When the entire table has to be searched, it's called a table scan.
当必须要搜索整个表时，就称为表扫描。
Accessing the rows using a table scan is a better choice in this case.
在这里，使用一个表扫描来访问行是更好的选择。
It will choose indexed access if it has lower cost than table scan.
如果使用索引的开销比表扫描的开销低，优化器将选择索引访问。
Currently, a full table scan is performed whenever RUNSTATS on table is run.
目前，要运行表上的RUNSTATS，就要执行全表扫描。
However, if no indexes are available, the query optimizer must use a table scan.
但如果没有索引，则查询优化器必须扫描表。
The method may be a table scan , or may be scanning one or more indexes if they exist.
可能采用的方法包括扫描表和扫描一个或多个索引（如果有） 。
The outer table can be accessed by an index scan or by a table scan, depending on the table.
通过索引扫描还是表扫描来访问外部表则取决于该表。
Thus, DB2 cannot use those indexes and resorts to a table scan to ensure a correct query result.
因此，DB 2不能使用那些索引，而是会采取表扫描来确保正确的查询结果。
Deterministic function calls can be extracted from the WHERE clause to avoid unnecessary table scan.
可以从WHERE子句中提取确定性函数调用，避免不必要的表扫描。
In this case, a table scan is very expensive, because the Informix engine has to access data randomly.
该例中，表扫描极其昂贵，因为Informix引擎必须随机地访问数据。
The simplest way is to read the table's data sequentially, performing a table scan as we usually call it.
最简单的方法是连续读取表中的数据，就是按照我们通常调用它的方法来执行表扫描。
Gather counts for base accesses (an index scan or a table scan of a table) that are not dependent on a join.
收集不依赖于连接(JOIN)的基本访问(表的索引扫描和表扫描)的计数。
Basically, it's weighing the choice of using the index to walk through the selected rows or doing a table scan.
基本上，它会权衡使用索引来遍历选择的行或者对表进行扫描这两种方式。
The preceding query requires MySQL to perform a full table scan, the slowest type of query for a large table.
上面的那个查询会执行一个全表扫描，对于一个大表来说这是最慢的一种查询方式。
The number of rows read (7700000) versus the number of rows written (77) show that a table scan is likely happening.
行读取的数目（77）表明很可能发生表扫描。
Since there is no COMMIT between the INSERT and SELECT statement, potentially the deadlock is caused by a table scan.
由于INSERT和select语句之间没有COMMIT，死锁可能是由表扫描引起的。
The optimizer, in the absence of current statistics, is choosing to do a table scan on both tables involved in the join.
在缺少当前统计的情况下，优化器选择对参与联接的两个表进行表扫描。
The predicates in the query in Listing 7 are weakly selective so that a full table scan of the PDBXML table is required.
清单7中查询的谓词选择性较弱，因此需要对pdbxml表进行全表扫描。
XSCAN is not an "XML table scan" but it can appear in an execution plan after a table scan to process each of the documents.
XSCAN不是 “XML表扫描”，但在表扫描之后，它可以出现在执行计划中，用来处理每个文档。
The optimizer normally chooses a table scan if no appropriate index has been created or if an index scan would be more costly.
如果没有创建合适的索引，或者如果索引扫描的成本更高一些，优化器通常就选择表扫描。
Most often, you want only a small subset of the data in the table, so a full table scan wastes a lot of disk I/O and therefore time.
通常来说，您可能只希望获得表中数据的一个子集，因此全表扫描会浪费大量的磁盘I/O，因此也就会浪费大量时间。
Since only one row is expected in the result set from this SELECT statement, the table scan here is considered an expensive operation.
因为该select语句的结果集中只期望一行，所以表扫描在这里被认为是代价较高的操作。
The plan shows a table scan over the aggregate_sales MQT. Moreover, the details of the operator table scan shows the following details.
该计划展示了aggregate_salesMQT上的一个表扫描。
Table 2 summarizes how the performance of this table scan query has benefited from two of our design decisions: atom site separation and compression.
表2总结了此次表扫描的性能如何能从我们的两个设计决策中受益：原子站点分离和压缩。
However since it is a leading table and will be accessed by the table scan only once, it may cause some performance problems, but it should not be a disaster.
尽管如此，由于它是主表，而且只用表扫描访问一次，因此会引发一些性能问题，但不会太严重。
Actually, a table scan of an in-memory table is much faster than searching the same table through an index, especially with the Informix light scan mechanism.
实际上，对内存中的表进行表扫描要比通过索引搜索同一表快得多，尤其是在使用 Informix轻型扫描机制时。
应用推荐