数据库服务器首先通过查找索引中的行，定位表中的相关行。
The database server locates relevant rows in the table by first finding the row in the index.
一个目录型网站需要一个名称的字顺列表来查找，但该列表不是一个结构化的、主题化的索引（如前所述）。
A directory-type site might require an alphabetical list of names to look up, but this would not be a structured, topical index (as explained above).
数据库服务器使用索引来查找匹配的值。
第三卷中的一个算法——关于排序和查找的算法——影响到第一个商业结合的索引文件系统的实施。
One of the algorithms in his third volume — on sorting and searching algorithms — inspired the first commercial implementation of an associatively indexed file system.
那么，每次可以直接从索引中读取值时，省略数据页的查找方法都要快得多。
It is much faster to omit data page lookups whenever values can be directly read from index.
索引为服务器提供了一种在表中查找特定数据行的方法，而不用搜索整个表。
Indexes provide a means for the server to find a particular row of data in the table without having to search the entire table.
还可将类别转换成排序列，后者提供了相同的查找功能但可使视图更快地进行索引。
Also, categories can be turned into sorted columns, which provide the same functionality for lookups but allow the view to index more quickly.
索引结构可以为个别包查找提供良好的性能，但SACK选项可能会覆盖包括多个包在内的任意多的字节数。
The index structure will give good performance looking up individual packets, but a SACK option can cover arbitrary byte ranges that include multiple packets.
在这种情况下，按名称查找属性可能会获得比按索引查找更好的性能。
In such cases, looking up an attribute by name could yield better performance than looking it up by index.
A：索引查找利用全局索引扫描，来确定对分区的引用是否存在。
A: With global index scans, the index look-up determines whether a reference to a partition exists.
它让DB 2使用索引来立即查找满足where子句中的两个简单谓词的行。
It lets DB2 use the index to immediately look up the row or rows that satisfy the two simple predicates in the WHERE clause.
然后列出DEPTNO，从而允许DB 2对第一列(EMPNO)执行直接索引查找，然后针对大于号扫描第二列(DEPTNO)。
And DEPTNO should be listed second, allowing DB2 to do a direct index lookup on the first column (EMPNO) and then a scan on the second (DEPTNO) for the greater-than.
类似于现有的用于关系索引的关系索引扫描操作符(IXSCAN)，XISCAN操作符在xml索引上执行查找或扫描。
Like the existing relational index scan operator for relational indexes (IXSCAN), the XISCAN operator performs lookups or scans on XML indexes.
OLTP查询中很少需要选择查找表作为需要相关表上的索引来支持联接的主查询表。
It is rare in an OLTP query for the lookup tables to be selected as the primary query tables requiring an index on the dependent table to support the join.
在许多例子中，这些索引是自动生成的，且极大地提升了查找的速度，即基于指定关键字段提供查找。
These indexes are automatically generated in many cases and speed lookups greatly — provided the lookups are based on designated key fields.
xslt样式表为字典编制索引、查找与nlsid属性值匹配的密钥、与字典中的当前语言匹配并检索已翻译的文本。
The XSLT style sheet indexes into the dictionary, finds the key that matches the value of the nlsid attribute, matches the current language in the dictionary, and retrieves the translated text.
因为random列的like值存储在一起，DB 2可以执行同样的查找，在我们索引的两个列上进行匹配。
Because like-kind values of the RANDOM column are stored together, DB2 can do an equal lookup, matching on two columns of our index.
存在许多有组织的信息索引，可以帮助您查找诊断问题所需要的内容。
There are many organized information indexes to help you find what you need to troubleshoot problems. Here are a few that you might want to try out.
可以很方便地利用清单7中展示的explain输出来描述其细节，可以对源表进行顺序扫描，并且在目标表上完成索引查找。
It is easier to describe this in detail using the explain output shown in Listing 7. Sequential scan is done on the source table, and index look-up is done on the target table.
sql _ query必须包括后续查找需要使用的主键，并且它必须包括需要索引和用作组的所有字段。
The sql_query must include the primary key you want to use for subsequent lookups, and it must include all the fields you want to index and use as groups.
LinkedIn在其Hadoop管道上构建了一个索引结构：这会产生几个TB的查找结构，该结构完美地使用了散列(每个键只需要2.5个位)。
LinkedIn builds an index structure in their Hadoop pipeline - this produces a multi-TB lookup structure that USES perfect hashing (requiring only 2.5 bits per key).
由于查询1表达了books表中的连接谓词，所以DB 2 9.1和9.5执行一个扫描authors的表，然后使用索引authoridx 1查找books表。
Since Query 1 expresses the join predicate on the books table, DB2 9.1 and 9.5 perform a table scan on authors and then use the index AUTHORIDX1 to probe into the books table.
设想我们要查找页面中提到的每个作者的名字和对他们著作的索引。
Imagine wanting to find the name of every author mentioned on the page and references to any books he or she may have written. When applied to our compound URL, the following SPARQL will do just that.
索引结构的深度(衡量执行索引查找所需的工作量)。
The depth of the index structure (a measure of the amount of work that is needed to perform an index lookup).
当用户从下拉菜单中选择了一个日期后，它必须被格式化为相应的字符串，需要进行反向查找，也就是根据索引查找缩写。
When a user selects a date from the drop down menu, it has to be formatted into the corresponding string, requiring the opposite lookup, namely the acronym given the index.
如果某个页面的URL包含搜索引擎正在查找的关键字，则该搜索引擎会认为该页面更为相关。
The search engine considers one page to be more relevant if the URL of the page contains the keyword it is looking for.
在这个由两部分组成的系列文章中，我们将注重于索引和编码技术，以及用来帮助用户查找问题代码的新工具。
In this two-part article series, we focus on indexing and coding techniques and on new tools to help users locate code trouble spots.
在这个由两部分组成的系列文章中，我们将注重于索引和编码技术，以及用来帮助用户查找问题代码的新工具。
In this two-part article series, we focus on indexing and coding techniques and on new tools to help users locate code trouble spots.
应用推荐