首页> 外国专利> Parallel build of non-partitioned join hash tables and non-enforced N:1 join hash tables

Parallel build of non-partitioned join hash tables and non-enforced N:1 join hash tables

机译:非分区连接散列表的并行构建和非强制性N:1加入哈希表

摘要

A method creating a compact hash table includes a thread executing using a processor for building a linear probe hash table based on allocating space for an array of keys. Payloads are inserted into the linear probe hash table. Keys from the array of keys are inserted into the linear probe hash table with linear probing. A linear probing bitmap is generated based on occupied locations in the linear probe hash table. A compact hash table is created based on the linear probe hash table and the linear probing bitmap.
机译:创建Cocket HASH表的方法包括使用处理器执行的线程,用于基于用于键数组的分配空间构建线性探测散列表。有效载荷插入线性探头哈希表中。键阵列键插入带有线性探测的线性探头哈希表。基于线性探测散列表中的占用位置生成线性探测位图。基于线性探针散列表和线性探测位图创建了一个紧凑的哈希表。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号