A lookup node is then created and initialized which also has the name service entry.
然后创建并初始化一个查找节点，它也有名称服务条目。
This node can lookup a collection of named column values from a located database row.
该节点可以从特定的数据库行查找指定列值的集合。
This node is added to the beginning of the lookup list and a reference to this node is returned as the import context.
把这个节点添加到查找列表的开头，作为导入上下文返回节点的引用。
The DatabaseRoute node is used primarily to perform routing decisions based on information it has sourced from a database lookup.
DatabaseRoute节点主要用于根据它从数据库查询中得到的信息执行路由决策。
Different cases for lookup require different XPath expressions to extract the specific result from the node that's returned from the XSLT key.
不同的查找情况需要不同的XPath表达式，从XSLTkey返回的节点中提取特定的结果。
The features of this routing structure are:(1) Combining tree and flow structure, which not only can lookup fast, but also can adapt to the dynamic node join or leave;
该路由结构的特点是：（1）结合了树结构和流结构，使该路由结构不仅能够快速查找，而且还能够适应动态的节点加入或离开；
All that does is lose the reference to the actual node module lookup paths, and create a new reference to some other thing that isn't used for anything.
这么做将会丢失对真正的模块搜索路径列表对象的引用，同时指向了一个新创建的对象，而这个对象将不会其任何作用。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
应用推荐