This query plan shows full table scans.
该查询计划显示了全表扫描。
You may notice excessive Numbers of table scans.
您也许注意到被扫描的表过多。
However, block locking was not be deferred for table scans.
然而，对于表扫描，块锁不会推迟。
This is a lot faster than a nested loop join of two table scans without any index usage.
这比不使用任何索引的两个表扫描的嵌套循环连接要快得多。
This will allow both of the following queries to use indexed access rather than table scans.
这将允许下面两个查询来使用索引访问，而不是表扫描。
Contiguity of physical data or keys is important to the speed of table scans or key-index scans.
物理数据或键的连续性对于表扫描或键-索引扫描的速度十分重要。
This makes DB2 queries use table scans instead of index scans and degrades database performance.
这使得DB 2查询使用表扫描代替索引扫描，并降低了数据库的性能。
The number of table scans reported represents the scans on the table between 1:00 p.m. and 2:00 p.m.
报告的表扫描次数表示在下午 1点到 2 点之间在这个表上执行的扫描。
Perform index analysis to make sure that the right indexes exist to help avoid unnecessary table scans.
执行索引分析，确保索引正确，从而能避免不必要的表扫描。
You can use the Design Advisor to see if indexes would result in an access plan with fewer table scans.
那么这时可以使用Design Advisor，看看索引是否能导致不需要扫描那么多表的访问计划。
Also as shown in Figure 11, you can see that there are still two table scans for each execution of the query.
还是如图11所示，每次执行查询都有两个表扫描。
The costs of table scans can be fairly low if the data in the table is clustered or if it is in physical order.
如果表中的数据进行了群集化处理，或者是有物理次序的，那么表扫描的成本就可能相当低。
Fragmentation and PDQ priority also have a huge effect on the speed of data retrieval and will help table scans.
分段和PD Q优先级也对于数据的检索速度有极大的影响，并有助于表扫描。
A high value here can indicate excessive table scans that can be prevented by creating indexes on the predicate columns.
如果该值很大，表示可以通过对谓词列创建索引来避免多余的表扫描。
Creating indexes helps avoid unnecessary table scans and sorts, speeds up frequently executed queries, and ensures uniqueness.
索引的创建有助于避免对表进行不必要的扫描和排序，加速频繁执行的查询以及确保惟一性。
It's also optimized for full table scans (one of the most common-and most time-consuming-business intelligence query access patterns).
它还针对完全表扫描(一个最常见—也最耗时—的商业智能查询访问模式)进行了优化。
Because of the number of table scans and table sorts in the TPC-H workload, prefetching data from disks into memory is important for optimal performance.
因为TPC - H工作负载中表扫描和表排序的数量较多，所以为获得最佳性能将数据从磁盘预取到内存是很重要的。
If the value is set to 0, then the optimizer chooses index scans over table scans if appropriate indexes exist, without even considering the estimated costs.
如果将其值设置为0，那么当存在合适的索引时，优化器就选择索引扫描而非表扫描，甚至不考虑估算成本。
Tuning can include adding extra indexes to yield a more efficient access plan, which makes tables volatile to encourage index usage and avoid table scans if possible.
调优包括添加额外索引来生成一个更高效的访问计划，让表格变幻无常，进而鼓励索引的使用，如果可能的话也可以避免表扫描。
DB2 row compression features can decrease disk storage requirements while at the same time improve sequential read access of large queries which perform full table scans.
DB 2行压缩功能可以减少磁盘存储需求，同时改进执行全表扫描的大量查询的顺序读取访问。
Prefetching is used when the Database Manager determines that sequential I/O is appropriate and that prefetching can help to improve performance (typically large table scans).
当数据库管理器确定顺序I/O是适当的，并且确定预取操作可能有助于提高性能时，会使用预取操作（通常是大型表扫描）。
If there is an index on the join column, the costs will be significantly less; otherwise the database server must perform table scans for all tables, both outer and inner tables.
如果连接列上有一个索引，那么其成本会相当低；否则，数据库服务器就必须对所有表(外部和内部表)执行表扫描。
When it finds an active partition, it scans the remaining partitions in the table to ensure that they're all inactive.
当找到一个活动分区时，它会扫描分区表中的其他分区，以确保它们都不是活动的。
Index scans are usually the most efficient way to access data, especially when the table is large but the number of qualified rows is small.
一般来说，索引扫描是访问数据的最有效的方法，尤其是表很大但符合条件的行很少的时候。
This locking was done for both index scans and table access whether or not the row of data was committed or whether it would have been excluded based on the statement's predicates.
不管数据行是否被提交，以及根据语句的谓词它是否被排除，对于索引扫描和表访问都执行这样的锁定操作。
For multiple index push-downs, multi-index scan is used to combine RIDs from different index scans, then skip-scan on the fact table is performed.
对于多索引下推，多索引扫描用于组合来自不同索引扫描的RID，然后就可以执行对事实表的跳跃式扫描了。
The first-stage boot loader scans the table, looking for the active partition; when the loader locates the partition, it loads the second-stage boot loader into RAM and invokes it.
第一阶段的引导加载程序对表进行扫描，查找活动分区；当加载程序找到分区时，就将第二阶段的引导加载程序加载到RAM中并调用它。
When DB2 scans a table, only the segments associated with that table are accessed.
当DB2扫描一个表时，只是访问与那个表相关的段。
The MON_GET_INDEX table function and db2pd utility provide the same index metrics (number of index scans and index only scans).
MON_GET_INDEX表函数和db2pd实用程序提供相同的索引度量指标（扫描索引和仅扫描索引的数量）。
Furthermore, deleted rows are skipped unconditionally on table scan access while deleted keys are not skipped for type-2 index scans unless the registry variable DB2_SKIPDELETED is also set.
而且，虽然在type - 2索引扫描中，被删除的行不会被跳过，但是除非同时设置了注册表变量db2_skipdeleted，否则在表扫描访问中，被删除的行将被无条件跳过。
应用推荐