Invention Grant
US08866644B2 Detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit strings using a hierarchical data structure
有权
使用分层数据结构来检测任意长度的位串输入是否匹配多个已知的任意长度位串中的一个
- Patent Title: Detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit strings using a hierarchical data structure
- Patent Title (中): 使用分层数据结构来检测任意长度的位串输入是否匹配多个已知的任意长度位串中的一个
-
Application No.: US13451877Application Date: 2012-04-20
-
Publication No.: US08866644B2Publication Date: 2014-10-21
- Inventor: Nabi Sertac Artan , H. Jonathan Chao
- Applicant: Nabi Sertac Artan , H. Jonathan Chao
- Applicant Address: US NY Brooklyn
- Assignee: Polytechnic Institute of New York University
- Current Assignee: Polytechnic Institute of New York University
- Current Assignee Address: US NY Brooklyn
- Agency: Straub & Pokotylo
- Agent John C. Pokotylo
- Main IPC: H03M7/34
- IPC: H03M7/34 ; G06F21/56 ; G06F17/30
Abstract:
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.
Public/Granted literature
Information query
IPC分类:
