• 后一种情况比较简单,所执行的是快速散列查找。

    The latter case is a simple and fast hash lookup.

    youdao

  • 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).

    youdao

  • 然后,它使用SHIP操作符读外表BAD_CREDIT,散列连接列的值,并检查为内表生成的查找表。

    IT then reads from the outer table BAD_CREDIT using the SHIP operator, hashing the join column values, and checking in the lookup table generated for the inner table.

    youdao

  • 该连接的执行过程包括扫描散列连接中的内表CUSTOMERS,并通过散列连接列的值生成一个查找表。

    The join is performed by scanning the inner table of the hash join, CUSTOMERS, and generating a lookup table by hashing the join column values.

    youdao

  • 顾名思义,散列部分用散列算法存储及查找它的键。

    As the name implies, the hash part USES a hash algorithm to store and find its keys.

    youdao

  • 顾名思义,散列部分用散列算法存储及查找它的键。

    As the name implies, the hash part USES a hash algorithm to store and find its keys.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定