会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and device for searching fixed length data
    • 用于搜索固定长度数据的方法和设备
    • US07469243B2
    • 2008-12-23
    • US10707943
    • 2004-01-27
    • Masaya MoriShinpei WatanabeYoshihisa TakatsuToshio Sunaga
    • Masaya MoriShinpei WatanabeYoshihisa TakatsuToshio Sunaga
    • G06F7/00G06F12/00G06F15/16
    • G06F17/30949G06F7/02Y10S707/99933
    • Embodiments of the present invention provide method and device for searching fixed length data. The device includes a hash operation means for operating and outputting a hash value of inputted fixed length data, a data table memory consisting of N numbers of memory banks, where N is an integer that is more than and equal to 2, the data table memory for storing a data table holding a large number of fixed length data, a pointer table memory for storing a memory pointer table holding a memory address at which each fixed length datum is stored with the hash value as an index, and a comparison means for simultaneously comparing a plurality of fixed length data stored at the same memory address in the N numbers of memory banks with a single fixed length datum inputted to the hash operation means, the comparison means for outputting results of the comparison.
    • 本发明的实施例提供了用于搜索固定长度数据的方法和装置。 该装置包括用于操作和输出输入的固定长度数据的散列值的散列操作装置,由N个存储体组成的数据表存储器,其中N是大于等于2的整数,数据表存储器 用于存储保持大量固定长度数据的数据表;指针表存储器,用于存储存储指针表,该存储器指针表保存以散列值作为索引存储每个固定长度数据的存储器地址;以及比较装置,用于同时 将存储在N个存储体组中的相同存储器地址的多个固定长度数据与输入到散列运算装置的单个固定长度数据进行比较,该比较装置用于输出比较结果。
    • 4. 发明授权
    • Search memory, memory search controller, and memory search method
    • 搜索内存,内存搜索控制器和内存搜索方法
    • US06898661B2
    • 2005-05-24
    • US10248781
    • 2003-02-18
    • Masaya MoriToshio SunagaShinpei Watanabe
    • Masaya MoriToshio SunagaShinpei Watanabe
    • G06F12/00G11C15/00G06F12/02
    • G11C15/00Y10S707/99933
    • A distributor and a search controller are added to the memory. A search is performed with an algorithm such as quick search by repeating reading of memory cells, comparing of the reading result, and narrowing down of entries to be compared based on the comparison result. Performing this sequential processing in the memory provides valid data in a bus time plus about half of a cycle time required in repeating reading a conventional memory. Then, the latter half of the cycle time can be used for comparison, as well as generation of the next memory cell address, so that the search can be finished in a bus time multiplied by the number of repetitions of reading the memory cells plus one bus time. As a result, a CAM function can be achieved that allows for more than tens of thousands of entry data items, the number of which is equal to the size of DRAM divided by the number of banks, rather than hundreds or thousands of entry data items as conventional CAM.
    • 分配器和搜索控制器被添加到存储器中。 基于比较结果,通过重复读取存储器单元,比较读取结果和缩小要比较的条目来进行快速搜索等算法的搜索。 在存储器中执行这种顺序处理在总线时间内提供有效的数据加上重复读取常规存储器所需的周期时间的大约一半。 然后,循环时间的后半部分可以用于比较,以及下一个存储单元地址的生成,使得可以在总线时间乘以读取存储器单元的重复次数加上一个 公共汽车时间。 结果,可以实现CAM功能,其允许数以万计的入口数据项,其数目等于DRAM的大小除以银行的数量,而不是数百或数千个条目数据项 如传统CAM。
    • 6. 发明授权
    • Communication control apparatus and method for searching an internet protocol address
    • 用于搜索因特网协议地址的通信控制装置和方法
    • US07460538B2
    • 2008-12-02
    • US10780213
    • 2004-02-17
    • Yoshihisa TakatsuShinpei WatanabeMasaya MoriToshio Sunaga
    • Yoshihisa TakatsuShinpei WatanabeMasaya MoriToshio Sunaga
    • H04L12/28H04J1/16G08C15/00G06F11/00
    • H04L45/00H04L45/48H04L45/7457Y10S707/99935
    • A communication control apparatus includes search information associated with a tree structure. A mask prefix is associated with at least one entry, each entry including information on the mask length of a mask prefix associated therewith and a sort key. Each entry is assigned to a node in the tree structure according to a sorting order. Each node is linked to a different node at the next lower hierarchy via a branch based on the entry of the node. A destination address of the packet received is first extracted, and a search target node specified by a search control for an entry having information on the best matched prefix of the extracted address is then searched for. After completion of the node-by-node search process, a transfer route is determined for the packet received based on the longest prefix amongst the most appropriate prefixes of all the current search target nodes.
    • 通信控制装置包括与树结构相关联的搜索信息。 掩码前缀与至少一个条目相关联,每个条目包括与其相关联的掩码前缀的掩码长度和排序密钥的信息。 每个条目根据排序顺序分配给树结构中的一个节点。 每个节点通过基于节点的条目的分支链接到下一个较低层次上的不同节点。 首先提取接收到的分组的目的地地址,然后搜索由具有关于提取的地址的最佳匹配前缀的信息的条目的搜索控制指定的搜索目标节点。 在逐节点搜索处理完成之后,基于所有当前搜索目标节点的最适合的前缀中的最长前缀来确定接收的分组的传输路由。