| 1. | Table scans always read and lock all the rows in the table
表扫描总是读取（并上锁）表中所有行。 |
| 2. | Cumulative count of range and table scans started on the index or heap
从索引或堆开始的范围和表扫描的累积计数。 |
| 3. | It will choose indexed access if it has lower cost than table scan
如果使用索引的开销比表扫描的开销低，优化器将选择索引访问。 |
| 4. | Table scan behavior
表扫描行为 |
| 5. | Avoid indexing very small tables because it is typically more efficient to do a table scan
因为进行表扫描通常效率更高，所以要避免对非常小的表创建索引。 |
| 6. | The optimizer is more likely to choose a full table scan over an index if the value of this parameter is high
为什么设置高了，优化器会选择全表扫描而不选择索引？ |
| 7. | This prevents a large table scan from completely dominating the buffer pool and adversely impacting random operations
这样可以防止大规模的表扫描完全支配缓冲池，并恶劣地影响随机操作。 |
| 8. | To save on i o operations , the query processor may choose to scan another index instead of performing a table scan
为了节省i / o操作，查询处理器可以选择扫描另一个索引，而不是执行表扫描。 |
| 9. | The optimizer , in the absence of current statistics , is choosing to do a table scan on both tables involved in the join
在缺少当前统计的情况下，优化器选择对参与联接的两个表进行表扫描。 |
| 10. | With contiguous data pages , dms tablespaces allow for much more efficient operations such as sequential table scans than sms tablespaces do
Dms表空间通过连续的数据页面支持比sms表空间要高效得多的操作，例如连续的表扫描。 |
