首页> 外国专利> Generating a hierarchical data structure associated with a plurality of known arbitrary-length bit strings used for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit string

Generating a hierarchical data structure associated with a plurality of known arbitrary-length bit strings used for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit string

机译:生成与用于检测任意长度位串输入是否与多个已知任意长度位串之一匹配的多个已知任意长度位串相关联的分层数据结构

摘要

Generating and using a high-speed, scalable, and easily updateable data structure are described. The proposed data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query.
机译:描述了生成和使用高速,可伸缩且易于更新的数据结构。所提出的数据结构提供了最小的完美哈希功能,同时本质上支持低成本的集合成员查询。换句话说,在一些实施例中,它在用于匹配查询的一组已知任意长度的位串中提供至多一个匹配候选者。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号