会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明申请
    • Method and data structure for performing regular expression searches in a fixed length word language
    • 用固定长度的单词语言执行正则表达式搜索的方法和数据结构
    • US20060074852A1
    • 2006-04-06
    • US11271934
    • 2005-11-10
    • Amit Finkelstein
    • Amit Finkelstein
    • G06F17/30
    • G06F17/30616Y10S707/99934Y10S707/99936Y10S707/99943
    • Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the “?” sign (any single character), the system of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The system may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the system of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.
    • 给定一个具有固定长度的所有单词的语言,以及仅由语言字母表中的字符组成的一组正则表达式或“?” 符号(任何单个字符),本发明的系统定义了用于有效地找到给定查询词的匹配正则表达式集合的数据结构。 可以通过适当地选择控制变量来调整系统以改变所需的存储空间和完成查询所需的搜索时间。 具体而言,本发明的系统提供了本发明的数据结构所需的存储空间与搜索这些数据结构以确定正则表达式的匹配集合的时间量之间的时间间隔权衡。
    • 10. 发明授权
    • Method and data structure for performing regular expression searches in a fixed length word language
    • 用固定长度的单词语言执行正则表达式搜索的方法和数据结构
    • US07386548B2
    • 2008-06-10
    • US11271934
    • 2005-11-10
    • Amit Finkelstein
    • Amit Finkelstein
    • G06F17/30
    • G06F17/30616Y10S707/99934Y10S707/99936Y10S707/99943
    • Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the “?” sign (any single character), the system of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The system may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the system of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.
    • 给定一个具有固定长度的所有单词的语言,以及仅由语言字母表中的字符组成的一组正则表达式或“?” 符号(任何单个字符),本发明的系统定义了用于有效地找到给定查询词的匹配正则表达式集合的数据结构。 可以通过适当地选择控制变量来调整系统以改变所需的存储空间和完成查询所需的搜索时间。 具体而言,本发明的系统提供了本发明的数据结构所需的存储空间与搜索这些数据结构以确定正则表达式的匹配集合的时间量之间的时间间隔权衡。