为了减小误差在不同扫描行之间的传播，利用透射数据对重建结果进行校正。
For reducing the error propagations among scanning lines, the transmission data are used for rectifying the scattering reconstruction.
为了实现多制式功能，提出了扫描行变换的方法，并对其关键性的技术进行了研究。
In order to realize the multi control function for the system, the scan row conversion method is adapted. Moreover, the concerned key techniques of the system are also analyzed in the paper.
该文在对收费站汽车牌照特征分析的基础上，提出了一种改进的基于扫描行的灰度跳变点特征的车牌定位算法。
Under the basis of the analysis to characteristic of toll station vehicle number-plate, this paper presents an improved number-plate locating method based on the characteristics of gray beep points.
在我们的例子中，通过索引扫描得到6574个候选行。
在这里，使用一个表扫描来访问行是更好的选择。
Accessing the rows using a table scan is a better choice in this case.
对于所扫描的数据包内的所有行，使用协议级别作为前缀。
Each line is prefixed with the protocol level within the packet that was scanned.
换句话说，我们顺序地扫描了此表，锁定了每个行，操作进行了很多次。
In other words, we have sequentially scanned this table, locking every row, a lot of times.
但是如果某个表有100,000或更多的行，那么重复的连续扫描将对性能产生致命影响。
But if a table has 100,000 or more rows, repeated sequential scans are deadly to performance.
因为该select语句的结果集中只期望一行，所以表扫描在这里被认为是代价较高的操作。
Since only one row is expected in the result set from this SELECT statement, the table scan here is considered an expensive operation.
不管数据行是否被提交，以及根据语句的谓词它是否被排除，对于索引扫描和表访问都执行这样的锁定操作。
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.
DB 2可以使用关系索引和xml索引来快速检索所关注的数据，避免了盲目地扫描表中的所有行。
DB2 can use both the relational and XML indexes to quickly pinpoint the data of interest, avoiding a costly scan of all rows in the table.
基本上，它会权衡使用索引来遍历选择的行或者对表进行扫描这两种方式。
Basically, it's weighing the choice of using the index to walk through the selected rows or doing a table scan.
接下来，参赛者需要向每个表添加合适的索引，以便Informix无需扫描整个表即可找到它需要更新的行。
Next, contestants needed to add appropriate indexes to each table, so that Informix would not scan the whole table to find the row it needed to update.
Time维度表中满足过滤条件的 time_id连接键被散列以创建一个位向量，用于过滤以上跳跃式扫描的Orders 表行。
The time_id join keys that meet the filter requirements on the Time dimension table are hashed to create a bit vector that filters rows of the Orders table from the skip scan above.
Next循环，扫描LotusSymphony电子表格的第一个工作表的前面500行，并且在第一列中查找可能的匹配。
Next loop to scan through the first 500 rows of the first worksheet in the Lotus Symphony spreadsheet, and it looks in the first column for possible matches.
而且，虽然在type - 2索引扫描中，被删除的行不会被跳过，但是除非同时设置了注册表变量db2_skipdeleted，否则在表扫描访问中，被删除的行将被无条件跳过。
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.
此规则的默认长度阈值是100(这意味着如果某个所扫描方法的长度超过100行，则PM d会报告出现一个违规)，但是如果您喜欢的话，可以降低该阈值。
This rule's default length threshold is 100 (meaning that if a scanned method has a length greater than 100 lines, PMD reports a rule violation), but you can lower that threshold if you like.
其中gre p扫描heroes . txt文件中的每一行并查找字母m，后面紧跟a，然后紧跟n。
如果查询中的表极其小(通常少于1,000行)或者是群集表，而且查询根本没有选择性的话，那么使用表扫描会更好一些。
If the table in your query are pretty small (usually fewer than 1,000 rows) or clustered tables, and your query is not selective at all, it would be beneficial to use a table scan.
一般来说，索引扫描是访问数据的最有效的方法，尤其是表很大但符合条件的行很少的时候。
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.
如果没有索引满足所取的行的要求顺序，或者优化器断定排序的代价低于索引扫描，那么就需要进行排序。
Sorting is required when no index satisfies the requested ordering of fetched rows, or the optimizer determines that a sort is less expensive than an index scan.
初级的方法是使用一个游标对表进行扫描，并为每一行执行一个定位的更新语句。
The naive approach USES a cursor to scan the table and execute a positioned update statement for each row.
如果使用表扫描，那么聚集就不会真正有益，因为DB 2仍然必须读取所有的行，那么物理排序不很重要了。
If a table scan is used, the clustering would not really be beneficial because DB2 still has to read all rows and then the physical ordering is not very important.
我们的第一个主要问题是，当我们想要一行的内容时，我们会扫描整个账单表，并锁定我们读取的每一行。
Our first major problem is that we are scanning the full bills table every time we want a row out of it and locking every row we read.
然后行id扫描(RIDSCN)操作符将扫描这些行，触发行预取，并将行id传递到fetch操作符。
The row ID scan (RIDSCN) operator then scans these row IDs, triggers row prefetching, and passes the row IDs to the fetch operator.
然后针对事实表扫描的每一行，外键也被散列并探测到位向量中，从而判断当前的事实表行是否被过滤掉了。
Then for each row from the fact table scan, the foreign key is also hashed and probed into the bit vector to determine whether the current fact table row is filtered out.
我们发现涉及大量行的查询的性能差异比较大，比如对所有20,000个XML文档进行全表扫描并对每个文档比较字符串。
We found a bigger difference for queries that touch a large number of rows, such as a table scan over all 20,000 XML documents with string comparison on every document.
DB 2行压缩功能可以减少磁盘存储需求，同时改进执行全表扫描的大量查询的顺序读取访问。
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.
在扫描完第一个表并将它放在哈希表中之后，就扫描第二个表，并在哈希表中查找该表中的每一行，看是否可以进行连接。
After the first table has been scanned and placed in a hash table, the second table is scanned and each row in the table is looked up in the hash table to see if a join can be made.
在扫描完第一个表并将它放在哈希表中之后，就扫描第二个表，并在哈希表中查找该表中的每一行，看是否可以进行连接。
After the first table has been scanned and placed in a hash table, the second table is scanned and each row in the table is looked up in the hash table to see if a join can be made.
应用推荐