会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • INVERTED TABLE FOR STORING AND QUERYING CONCEPTUAL INDICES
    • 存储和查询概念指标的反相表
    • US20160012125A1
    • 2016-01-14
    • US14644771
    • 2015-03-11
    • International Business Machines Corporation
    • Michele M. FranceschiniLuis A. Lastras-MontanoLivio B. SoaresMark N. Wegman
    • G06F17/30
    • G06F17/30628G06F17/30687G06F17/30864G06F17/30958
    • According to an aspect, storing and querying conceptual indices (CIs) includes creating a conceptual inverted index (CII) from the CIs. The CII includes CII entries, each of which corresponds to a concept in a concept graph. Creating the CII includes populating each entry with pointers to documents selected from the CIs having likelihoods of being related to the concept that are greater than a threshold value, and the corresponding likelihoods. An aspect also includes receiving a query that includes a concept in the concept graph, and generating query results from a search that include at least a subset of the pointers to documents. Each of the CIs is associated with a corresponding document and includes a CI entry for each concept in the concept graph, and each of the CI entries specifies a value indicating a likelihood that the document is related to the concept in the concept graph.
    • 根据一个方面,存储和查询概念索引(CI)包括从CI创建概念倒置索引(CII)。 CII包括CII条目,每个条目对应于概念图中的概念。 创建CII包括填充每个条目,其中指示从具有与大于阈值的概念相关的可能性的CI中选择的文档以及相应的可能性。 方面还包括接收包括概念图中的概念的查询,以及从搜索生成至少包括指向文档的指针子集的查询结果。 每个CI与相应的文档相关联,并且包括概念图中的每个概念的CI条目,并且每个CI条目指定一个值,该值指示文档与概念图中的概念相关。
    • 7. 发明授权
    • Service-aware distributed hash table routing
    • 服务感知分布式哈希表路由
    • US09069761B2
    • 2015-06-30
    • US13480647
    • 2012-05-25
    • Steven V. LuongManish Bhardwaj
    • Steven V. LuongManish Bhardwaj
    • G06F15/173G06F17/30H04L29/08H04L29/06
    • G06F17/30G06F17/30628H04L67/10H04L67/1046H04L67/1065H04L67/327H04L69/24
    • In one embodiment, a node in a computer network joins a global ring associated with a distributed hash table (DHT), and maintains a DHT routing table and DHT database for the global ring. In addition, the node may determine a particular service class for which the node is configured, and may join a particular service-based sub-ring according to the particular service class, where all nodes of the particular service-based sub-ring are within the global ring. As such, a service-based DHT routing table and service-based DHT database may be maintained for the particular service-based sub-ring, such that DHT operations identified by the particular service class are routed to the particular service-based sub-ring (e.g., by a portal node).
    • 在一个实施例中,计算机网络中的节点加入与分布式哈希表(DHT)相关联的全局环,并且维护用于全局环的DHT路由表和DHT数据库。 另外,节点可以确定节点被配置的特定服务类别,并且可以根据特定服务类加入特定的基于服务的子环,其中特定的基于服务的子环的所有节点都在其中 全球戒指 因此,可以为特定的基于服务的子环维护基于服务的DHT路由表和基于服务的DHT数据库,使得由特定服务类标识的DHT操作被路由到特定的基于服务的子环 (例如,由门户节点)。
    • 8. 发明申请
    • Apparatus and Method for Hash Table Access
    • 哈希表访问的设备和方法
    • US20150074372A1
    • 2015-03-12
    • US14024139
    • 2013-09-11
    • Advanced Micro Devices, Inc.
    • Mithuna THOTTETHODISteven Reinhardt
    • G06F12/10
    • G06F17/30628
    • A system and method for accessing a hash table are provided. A hash table includes buckets where each bucket includes multiple chains. When a single instruction multiple data (SIMD) processor receives a group of threads configured to execute a key look-up instruction that accesses an element in the hash table, the threads executing on the SIMD processor identify a bucket that stores a key in the key look-up instruction. Once identified, the threads in the group traverse the multiple chains in the bucket, such that the elements at a chain level in the multiple chains are traversed in parallel. The traversal continues until a key look-up succeeds or fails.
    • 提供了一种访问散列表的系统和方法。 散列表包括桶,其中每个桶包括多个链。 当单指令多数据(SIMD)处理器接收被配置为执行访问哈希表中的元素的键查找指令的一组线程时,在SIMD处理器上执行的线程识别存储密钥的存储桶 查询指令。 一旦被识别,组中的线程遍历桶中的多个链,使得多个链中的链级的元素并行地遍历。 遍历继续,直到键查找成功或失败。