专利名称：Detecting whether an arbitrary-length bit
string input matches one of a plurality of
known arbitrary-length bit strings using a
hierarchical data structure
字符串长度比较
发明人：Nabi Sertac Artan,H. Jonathan Chao
申请号：US11978185
申请日：20071026
公开号：US20080111716A1
公开日：
20080515
专利内容由知识产权出版社提供
专利附图：
摘要：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.
申请人：Nabi Sertac Artan,H. Jonathan Chao
地址：Brooklyn NY US,Holmdel NJ US
国籍：US,US
更多信息请下载全文后查看

版权声明：本站内容均来自互联网，仅供演示用，请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系QQ:729038198，我们将在24小时内删除。