专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07797348B2 Data structure and system for IP address lookup and IP address lookup system 有权
标题翻译： IP地址查询和IP地址查询系统的数据结构和系统
公开(公告)号：US07797348B2
公开(公告)日：2010-09-14
申请号：US10836577
申请日：2004-04-30
申请人： Robert Wing Pong Luk , Wai Tak Wong
发明人： Robert Wing Pong Luk , Wai Tak Wong
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , H04L45/54 , H04L45/7457
摘要： A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.
摘要翻译：用于存储被划分为子串的可搜索数据的字符串的树数据结构具有至少一个具有与其相关联的子字符串的第一类型节点和至少一个不具有与其相关联的子字符串的第二类型节点。第二类节点通过故障转移直接链接到第一类节点。第一类型节点通过匹配转换直接链接到第二类节点。 IP地址查找系统具有存储树数据结构的存储器和用于存储和加载输入IP地址的控制器。该系统具有三级的有限状态机，包括用于加载IP地址和执行长度计算的第一级，用于搜索数据结构以找到匹配的第二级，以及用于确定下一跳地址索引的第三级。

2. 发明申请

US20120239702A1 STRING LOOKUP USING THREE-TRANSITION TREE STRUCTURE 有权
标题翻译：使用三次过渡树结构的STRING LOOKUP
公开(公告)号：US20120239702A1
公开(公告)日：2012-09-20
申请号：US13433053
申请日：2012-03-28
申请人： Robert Wing Pong Luk , Wai Tak Wong
发明人： Robert Wing Pong Luk , Wai Tak Wong
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： H04L45/00 , H04L45/54 , H04L45/7457
摘要： A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.
摘要翻译：用于存储被划分为子串的可搜索数据的字符串的树数据结构具有至少一个具有与其相关联的子字符串的第一类型节点和至少一个不具有与其相关联的子字符串的第二类型节点。第二类节点通过故障转移直接链接到第一类节点。第一类型节点通过匹配转换直接链接到第二类节点。 IP地址查找系统具有存储树数据结构的存储器和用于存储和加载输入IP地址的控制器。该系统具有三级的有限状态机，包括用于加载IP地址和执行长度计算的第一级，用于搜索数据结构以找到匹配的第二级，以及用于确定下一跳地址索引的第三级。

3. 发明授权

US08538999B2 String lookup using three-transition tree structure 有权
标题翻译：使用三转换树结构的字符串查找
公开(公告)号：US08538999B2
公开(公告)日：2013-09-17
申请号：US13433053
申请日：2012-03-28
申请人： Robert Wing Pong Luk , Wai Tak Wong
发明人： Robert Wing Pong Luk , Wai Tak Wong
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , H04L45/54 , H04L45/7457
摘要： A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.
摘要翻译：用于存储被划分为子串的可搜索数据的字符串的树数据结构具有至少一个具有与其相关联的子字符串的第一类型节点和至少一个不具有与其相关联的子字符串的第二类型节点。第二类节点通过故障转移直接链接到第一类节点。第一类型节点通过匹配转换直接链接到第二类节点。 IP地址查找系统具有存储树数据结构的存储器和用于存储和加载输入IP地址的控制器。该系统具有三级的有限状态机，包括用于加载IP地址和执行长度计算的第一级，用于搜索数据结构以找到匹配的第二级，以及用于确定下一跳地址索引的第三级。

4. 发明申请

US20110022624A1 DATA STRUCTURE AND SYSTEM FOR IP ADDRESS LOOKUP AND IP ADDRESS LOOKUP SYSTEM 有权
标题翻译：用于IP地址查找和IP地址查找系统的数据结构和系统
公开(公告)号：US20110022624A1
公开(公告)日：2011-01-27
申请号：US12869332
申请日：2010-08-26
申请人： Robert Wing Pong LUK , Wai Tak WONG
发明人： Robert Wing Pong LUK , Wai Tak WONG
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , H04L45/54 , H04L45/7457
摘要： A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.
摘要翻译：用于存储被划分为子串的可搜索数据的字符串的树数据结构具有至少一个具有与其相关联的子字符串的第一类型节点和至少一个不具有与其相关联的子字符串的第二类型节点。第二类节点通过故障转移直接链接到第一类型节点。第一类型节点通过匹配转换直接链接到第二类节点。 IP地址查找系统具有存储树数据结构的存储器和用于存储和加载输入IP地址的控制器。该系统具有三级的有限状态机，包括用于加载IP地址和执行长度计算的第一级，用于搜索数据结构以找到匹配的第二级，以及用于确定下一跳地址索引的第三级。

5. 发明申请

US20100205172A1 METHOD FOR USING DUAL INDICES TO SUPPORT QUERY EXPANSION, RELEVANCE/NON-RELEVANCE MODELS, BLIND/RELEVANCE FEEDBACK AND AN INTELLIGENT SEARCH INTERFACE 有权
标题翻译：使用双指标支持查询扩展的方法，相关/非相关模型，盲/相关反馈和智能搜索界面
公开(公告)号：US20100205172A1
公开(公告)日：2010-08-12
申请号：US12368282
申请日：2009-02-09
申请人： Robert Wing Pong LUK
发明人： Robert Wing Pong LUK
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30616 , G06F17/30675
摘要： A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, comprising using a computing device (89) to: access (101) an inverted index (103) to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determine (105) a number of “N” IUs in the results that are assumed to be relevant by accessing a forward index (104); wherein the forward index (104) and inverted index (103) have pointers to locations in the IUs where terms of the query occur, and the forward index (104) retrieves a term frequency vector of the IU or a set of contexts of the IU.
摘要翻译：一种使用双重索引来支持查询扩展，相关性/非相关性模型，盲目/相关性反馈和智能搜索界面的方法，包括使用计算设备（89）来访问（101）反向索引（103）以获得响应于查询的结果的初始检索，以及生成结果的排名列表，结果参考查询发生的信息单元（IU）; 并且确定（105）通过访问前向索引（104）而被假设为相关的结果中的多个“N”IU; 其中所述前向索引（104）和反向索引（103）具有指向所述查询的条件发生的所述IU中的位置的指针，并且所述前向索引（104）检索所述IU的术语频率向量或IU的一组上下文。

6. 发明授权

US06976025B2 Database and method for storing a searchable set of keywords 有权
标题翻译：用于存储可搜索的一组关键字的数据库和方法
公开(公告)号：US06976025B2
公开(公告)日：2005-12-13
申请号：US10112043
申请日：2002-04-01
申请人： Robert Wing Pong Luk , Wai Chung Yip
发明人： Robert Wing Pong Luk , Wai Chung Yip
IPC分类号： G06F17/30 , G06F7/00 , G06F17/00
CPC分类号： G06F17/30985 , Y10S707/99933
摘要： A methods for storing a searchable set of keywords includes concatenating the keywords to form a string, and defining one or more links between two or more characters in the string. A delimiting character separates the keywords in the string, and the links are pointers. Any inaccessible characters in the string are removed to improve the storage cost the method.
摘要翻译：用于存储可搜索的关键词集合的方法包括连接关键字以形成字符串，以及在字符串中的两个或更多个字符之间定义一个或多个链接。分隔符分隔字符串中的关键字，链接是指针。删除字符串中任何无法访问的字符，以提高该方法的存储成本。

7. 发明授权

US08620900B2 Method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface 有权
标题翻译：使用双重索引支持查询扩展，相关性/非相关性模型，盲目/相关性反馈和智能搜索界面的方法
公开(公告)号：US08620900B2
公开(公告)日：2013-12-31
申请号：US12368282
申请日：2009-02-09
申请人： Robert Wing Pong Luk
发明人： Robert Wing Pong Luk
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30616 , G06F17/30675
摘要： A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, comprising using a computing device to: access an inverted index to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determine a number of “N” IUs in the results that are regarded by the computing device to be relevant by accessing a forward index; and use the forward index to perform any one from the group consisting of: computing query expansion weights for top “N” retrieved IUs, building the relevance models by the contexts of query terms in the top “N” retrieved IUs, and finding the longest contiguous sequences of query terms in a query found in an IU; wherein the forward index and inverted index have pointers to locations in the IUs where terms of the query occur, and the forward index retrieves a term frequency vector of the IU or a set of contexts of the IU.
摘要翻译：一种使用双重索引来支持查询扩展，相关性/非相关性模型，盲目/相关性反馈和智能搜索界面的方法，包括使用计算设备来：访问反向索引以获得对结果的初始检索以响应于查询并生成结果的排名列表，结果指的是发生查询的信息单元（IU）; 并且通过访问前向索引来确定计算设备被认为是相关的结果中的“N”个IU数量; 并使用前向索引执行以下组中的任何一个：针对顶部“N”个检索的IU的计算查询扩展权重，通过顶部“N”个检索的IU中的查询项的上下文建立相关性模型，并且找到最长在IU中查询的查询词的连续序列; 其中所述前向索引和反向索引具有指向所述查询的条件发生的所述IU中的位置的指针，并且所述前向索引检索所述IU的术语频率向量或所述IU的一组上下文。

8. 发明授权

US08150891B2 System for IP address lookup using substring and prefix matching 有权
标题翻译：使用子字符串和前缀匹配的IP地址查找系统
公开(公告)号：US08150891B2
公开(公告)日：2012-04-03
申请号：US12869332
申请日：2010-08-26
申请人： Robert Wing Pong Luk , Wai Tak Wong
发明人： Robert Wing Pong Luk , Wai Tak Wong
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , H04L45/54 , H04L45/7457
摘要： A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.
摘要翻译：用于存储被划分为子串的可搜索数据的字符串的树数据结构具有至少一个具有与其相关联的子字符串的第一类型节点和至少一个不具有与其相关联的子字符串的第二类型节点。第二类节点通过故障转移直接链接到第一类节点。第一类型节点通过匹配转换直接链接到第二类节点。 IP地址查找系统具有存储树数据结构的存储器和用于存储和加载输入IP地址的控制器。该系统具有三级的有限状态机，包括用于加载IP地址和执行长度计算的第一级，用于搜索数据结构以找到匹配的第二级，以及用于确定下一跳地址索引的第三级。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式