Hierarchical scale unit values for storing instances of data among nodes of a distributed store
    91.
    发明授权
    Hierarchical scale unit values for storing instances of data among nodes of a distributed store 有权
    用于存储分布式存储的节点之间的数据实例的分级缩放单位值

    公开(公告)号:US09325802B2

    公开(公告)日:2016-04-26

    申请号:US12503994

    申请日:2009-07-16

    IPC分类号: H04L29/08 G06F17/30 G06F11/20

    摘要: Techniques are described herein for storing instances of data among nodes of a distributed store based on hierarchical scale unit values. Hierarchical scale unit values are assigned to the respective nodes of the distributed store. A first instance (e.g., a primary instance) of a data module is stored in a first node having a first hierarchical scale unit value. A primary instance of the data module with respect to a data operation is an instance of the data module at which the data operation with respect to the data module is initiated or initially directed. A second instance (e.g., a primary or secondary instance) of the data module is stored in a second node having a second hierarchical scale unit value based on a magnitude of a difference between the first hierarchical scale unit value and the second hierarchical scale unit value. A secondary instance is essentially a “back-up” instance.

    摘要翻译: 本文描述了用于基于分级比例单位值来存储分布式存储的节点之间的数据实例的技术。 分层比例单位值被分配给分布式存储的相应节点。 数据模块的第一实例(例如主要实例)被存储在具有第一分级比例单位值的第一节点中。 关于数据操作的数据模块的主要实例是数据模块的实例,在该实例中数据模块相对于数据模块的数据操作被启动或初始定向。 数据模块的第二实例(例如,主要或次要实例)基于第一分级比例尺单位值和第二分级比例单位值之间的差值的大小被存储在具有第二分级比例单位值的第二节点中 。 次要实例本质上是一个“备份”实例。

    Consistent messaging with replication
    92.
    发明授权
    Consistent messaging with replication 有权
    与复制一致的消息传递

    公开(公告)号:US08589732B2

    公开(公告)日:2013-11-19

    申请号:US12978336

    申请日:2010-12-23

    IPC分类号: G06F11/00

    摘要: A messaging entity configured in a memory of first node of a plurality communicatively coupled nodes is disclosed. The nodes are included in a distributed computing system. The messaging entity is configured to operate as a secondary messaging entity in a messaging server for the plurality communicatively coupled nodes. The messaging entity is communicatively couple to a primary messaging entity configured in a memory of a second node of the plurality of nodes. The primary messaging entity is configured to store a message; store a copy of the message. Also, the messaging entity is configured to be promoted to a new primary messaging entity in the event of failure of the primary messaging entity.

    摘要翻译: 公开了一种配置在多个通信耦合节点的第一节点的存储器中的消息传送实体。 节点包括在分布式计算系统中。 消息传送实体被配置为在用于多个通信耦合节点的消息收发服务器中作为次要消息接发实体操作。 消息传递实体通信地耦合到配置在多个节点中的第二节点的存储器中的主要消息传送实体。 主消息实体被配置为存储消息; 存储消息的副本。 此外,消息传递实体被配置为在主要消息传递实体失败的情况下被提升为新的主要消息传递实体。

    Changing ranking algorithms based on customer settings
    93.
    发明授权
    Changing ranking algorithms based on customer settings 有权
    根据客户设置改变排名算法

    公开(公告)号:US08412717B2

    公开(公告)日:2013-04-02

    申请号:US13169688

    申请日:2011-06-27

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30867 G06F17/30699

    摘要: Search term ranking algorithms can be generated and updated based on customer settings, such as where a ranking algorithm is modeled as a combination function of different ranking factors. An end user of a search system provides personalized preferences for weighted attributes, generally or for a single instance of the query. The user also can indicate the relative importance of one or more ranking factors by specifying different weights to the factors. Ranking factors can specify document attributes, such as document title, document body, document page rank, etc. Based on the attribute weights and the received user query, a ranking algorithm function will produce the relevant value for each document corresponding to the user preferences and personalization configurations.

    摘要翻译: 搜索项排序算法可以根据客户设置生成和更新,例如排序算法被建模为不同排名因素的组合函数。 搜索系统的最终用户为加权属性提供个性化偏好,一般或单个查询实例。 用户还可以通过为因素指定不同的权重来指示一个或多个排名因子的相对重要性。 排名因素可以指定文档属性,如文档标题,文档正文,文档页面排名等。基于属性权重和接收到的用户查询,排序算法函数将为每个文档生成与用户偏好相对应的相关值, 个性化配置

    Cache enumeration and indexing
    95.
    发明授权
    Cache enumeration and indexing 有权
    缓存枚举和索引

    公开(公告)号:US08261020B2

    公开(公告)日:2012-09-04

    申请号:US12469688

    申请日:2009-05-21

    IPC分类号: G06F12/00

    摘要: In response to a request including a state object, which can indicate a state of an enumeration of a cache, the enumeration can be continued by using the state object to identify and send cache data. Also, an enumeration of cache units can be performed by traversing a data structure that includes object nodes, which correspond to cache units, and internal nodes. An enumeration state stack can indicate a current state of the enumeration, and can include state nodes that correspond to internal nodes in the data structure. Additionally, a cache index data structure can include a higher level table and a lower level table. The higher level table can have a leaf node pointing to the lower level table, and the lower level table can have a leaf node pointing to one of the cache units. Moreover, the lower level table can be associated with a tag.

    摘要翻译: 响应于包括可指示高速缓存的枚举状态的状态对象的请求,可以通过使用状态对象来识别和发送高速缓存数据来继续枚举。 此外,可以通过遍历包括对应于高速缓存单元的对象节点和内部节点的数据结构来执行缓存单元的枚举。 枚举状态堆栈可以指示枚举的当前状态,并且可以包括对应于数据结构中的内部节点的状态节点。 此外,缓存索引数据结构可以包括更高级别的表和较低级别的表。 较高级别的表可以具有指向低级表的叶节点,并且下级表可以具有指向其中一个高速缓存单元的叶节点。 此外,较低级别的表可以与标签相关联。

    Consistency models in a distributed store
    96.
    发明授权
    Consistency models in a distributed store 有权
    分布式商店中的一致性模型

    公开(公告)号:US08151062B2

    公开(公告)日:2012-04-03

    申请号:US12433841

    申请日:2009-04-30

    IPC分类号: G06F13/00

    摘要: Systems and methods that designate read/write consistency models based on requirements of a distributed store to increase performance or scale. Such sever loads can be determined via a plurality of mechanisms, including delays in responses by the primary node; setting predetermined threshold limits that if exceeded results in contacting secondary nodes; polling services of the distributed cache periodically and maintaining track of loads on the servers, and the like. The weak or scalable read can occur when read requests are directed to a secondary node, and upon over loading of the primary node.

    摘要翻译: 基于分布式存储的需求来指定读/写一致性模型的系统和方法,以提高性能或规模。 这样的服务器负载可以通过多个机制来确定,包括主节点的响应延迟; 设置如果超出的预定阈值限制导致接触次级节点; 周期性地分发缓存的轮询服务和维护服务器上的负载跟踪等。 当读请求定向到辅助节点时,以及在过载主节点时,可能会发生弱或可扩展读取。

    Knowledge extraction for automatic ontology maintenance
    97.
    发明授权
    Knowledge extraction for automatic ontology maintenance 有权
    自动本体维护知识提取

    公开(公告)号:US07930288B2

    公开(公告)日:2011-04-19

    申请号:US11712346

    申请日:2007-02-28

    IPC分类号: G06F7/00

    CPC分类号: G06F17/278 G06F17/30731

    摘要: Systems, methods, and other embodiments associated with extracting knowledge from application data and maintaining an ontology based on the extracted knowledge are described. One example system includes a mapping logic to store mappings between application objects and ontology classes and an information extraction (IE) logic that accesses the mapping logic to identify application data to process based on the mappings. The application data may be stored in application data repositories belonging to an enterprise and may be characterized by the application object. Having identified application data to process, the IE logic may locate data in the application data repositories and selectively manipulate an ontology based on selected application data elements.

    摘要翻译: 描述了与从提取的知识中提取知识和维护基于所提取的知识的本体相关联的系统,方法和其他实施例。 一个示例性系统包括用于存储应用对象和本体类之间的映射的映射逻辑,以及访问映射逻辑以识别基于映射进行处理的应用数据的信息提取(IE)逻辑。 应用数据可以存储在属于企业的应用数据存储库中,并且可以由应用对象来表征。 在确定要处理的应用数据之后,IE逻辑可以将数据定位在应用数据存储库中,并基于所选择的应用数据元素选择性地操纵本体。

    Distributed Cache Availability During Garbage Collection
    98.
    发明申请
    Distributed Cache Availability During Garbage Collection 审中-公开
    垃圾收集期间的分布式缓存可用性

    公开(公告)号:US20100318584A1

    公开(公告)日:2010-12-16

    申请号:US12484185

    申请日:2009-06-13

    IPC分类号: G06F12/00 G06F12/08

    CPC分类号: G06F12/0253 G06F12/0806

    摘要: Techniques are described herein for managing access to a distributed cache during garbage collection. When garbage collection is to be performed with respect to a node, the node may send a request to a data manager requesting to have an instance of data module(s) included in the node that are in a primary state placed in a secondary state. The data manager may change the state of the data module(s) to the secondary state. The data manager may change the state of another instance of the data module(s) that is included in another node to the primary state. When the garbage collection is complete with respect to the node, the node may send another request to the data manager requesting that the data module(s) that were placed in the secondary state be returned to the primary state. The data manager may return those data module(s) to the primary state.

    摘要翻译: 本文描述了在垃圾收集期间管理对分布式缓存的访问的技术。 当相对于节点执行垃圾回收时,节点可以向数据管理器发送一个请求,该数据管理器请求将节点中包括的处于主状态的数据模块的实例置于次级状态。 数据管理器可以将数据模块的状态更改为辅助状态。 数据管理器可以将包含在另一个节点中的数据模块的另一个实例的状态改变为主状态。 当相对于节点完成垃圾收集时,节点可以向数据管理器发送另一个请求,请求将处于次要状态的数据模块返回到主状态。 数据管理器可以将这些数据模块返回到主状态。

    CACHE ENUMERATION AND INDEXING
    99.
    发明申请
    CACHE ENUMERATION AND INDEXING 有权
    缓存创建和索引

    公开(公告)号:US20100293332A1

    公开(公告)日:2010-11-18

    申请号:US12469688

    申请日:2009-05-21

    IPC分类号: G06F12/08 G06F17/30 G06F12/00

    摘要: In response to a request including a state object, which can indicate a state of an enumeration of a cache, the enumeration can be continued by using the state object to identify and send cache data. Also, an enumeration of cache units can be performed by traversing a data structure that includes object nodes, which correspond to cache units, and internal nodes. An enumeration state stack can indicate a current state of the enumeration, and can include state nodes that correspond to internal nodes in the data structure. Additionally, a cache index data structure can include a higher level table and a lower level table. The higher level table can have a leaf node pointing to the lower level table, and the lower level table can have a leaf node pointing to one of the cache units. Moreover, the lower level table can be associated with a tag.

    摘要翻译: 响应于包括可指示高速缓存的枚举状态的状态对象的请求,可以通过使用状态对象来识别和发送高速缓存数据来继续枚举。 此外,可以通过遍历包括对应于高速缓存单元的对象节点和内部节点的数据结构来执行缓存单元的枚举。 枚举状态堆栈可以指示枚举的当前状态,并且可以包括对应于数据结构中的内部节点的状态节点。 此外,缓存索引数据结构可以包括更高级别的表和较低级别的表。 较高级别的表可以具有指向低级表的叶节点,并且下级表可以具有指向其中一个高速缓存单元的叶节点。 此外,较低级别的表可以与标签相关联。

    Searching related documents
    100.
    发明申请
    Searching related documents 有权
    搜索相关文件

    公开(公告)号:US20080235210A1

    公开(公告)日:2008-09-25

    申请号:US11726275

    申请日:2007-03-21

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30011

    摘要: Systems, methods, and other embodiments associated with logically expanding a document and determining the relevance of the logically expanded document to a query are described. One method embodiment includes searching an index to locate a document identifier for a document in which a query term appears. The method includes determining whether the index entry includes an expansion identifier, and, if so, producing a logically expanded document. The logically expanded document may include both a document associated with the document identifier and a document associated with the expansion identifier. The method may then determine a relevance value of the logically expanded document with respect to the query and may provide a signal corresponding to the relevance value.

    摘要翻译: 描述了与逻辑上扩展文档相关联的系统,方法和其他实施例,并且确定逻辑上扩展的文档与查询的相关性。 一个方法实施例包括搜索索引以定位其中出现查询词的文档的文档标识符。 该方法包括确定索引条目是否包括扩展标识符,如果是,则生成逻辑上扩展的文档。 逻辑上扩展的文档可以包括与文档标识符相关联的文档和与扩展标识符相关联的文档。 该方法然后可以确定相对于查询的逻辑扩展文档的相关性值,并且可以提供对应于相关性值的信号。