Method and system for semantic publish-subscribe services
    3.
    发明授权
    Method and system for semantic publish-subscribe services 有权
    语义发布 - 订阅服务的方法和系统

    公开(公告)号:US08112416B2

    公开(公告)日:2012-02-07

    申请号:US11754068

    申请日:2007-05-25

    IPC分类号: G06F7/00

    CPC分类号: G06F17/2785 G06F17/30699

    摘要: A semantic publish-subscribe system, including: a plurality of subscribers; a plurality of publishers; and a server that receives and stores subscriptions that are described in web ontology language (OWL) graph patterns from the plurality of subscribers and that receives events that are described in semantic graphs formed by OWL assertions from the plurality of publishers, wherein when the server receives an event from a publisher, the server expands the OWL assertions of the event using a reasoner to produce an expanded event, the server matches the expanded event to a subscription, and then, the server notifies a subscriber whose interest matches the event.

    摘要翻译: 一种语义发布订阅系统,包括:多个用户; 多个出版商; 以及服务器,其接收并存储来自所述多个订户的以网络本体语言(OWL)图形模式描述的订阅,并且接收在所述多个发布者中由OWL断言形成的语义图中描述的事件,其中,当所述服务器接收到 来自发布者的事件,服务器使用推理器来扩展事件的OWL断言,以生成扩展事件,服务器将展开的事件与订阅进行匹配,然后,服务器通知其兴趣与事件匹配的用户。

    Processing overlapping continuous queries
    4.
    发明授权
    Processing overlapping continuous queries 失效
    处理重复的连续查询

    公开(公告)号:US08055653B2

    公开(公告)日:2011-11-08

    申请号:US11836567

    申请日:2007-08-09

    IPC分类号: G06F17/20 G06F15/16

    CPC分类号: G06F17/30463 G06F17/3046

    摘要: An edge-covering based greedy method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a unit price of each filter, evaluating, sequentially, each filter in order of a lowest to a highest unit price, to determine a value for each filter, and changing an ordering of the filters according to the values. An edge-covering based harmonic method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a weight of each filter, evaluating, randomly, each filter having a probability inversely proportionally to its weight, to determine a value, and changing an ordering of the filters according to the values.

    摘要翻译: 用于共享过滤器排序的基于边缘覆盖的贪婪方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的单价,评估 顺序地按每个过滤器按最低到最高单价的顺序,确定每个过滤器的值,并根据该值改变过滤器的排序。 用于共享过滤器排序的基于边缘覆盖的谐波方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的权重, 随机地,每个滤波器具有与其权重成反比的概率,以确定值,并根据该值改变滤波器的排序。

    Processing Overlapping Continuous Queries
    5.
    发明申请
    Processing Overlapping Continuous Queries 失效
    处理重叠的连续查询

    公开(公告)号:US20090043729A1

    公开(公告)日:2009-02-12

    申请号:US11836567

    申请日:2007-08-09

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30463 G06F17/3046

    摘要: An edge-covering based greedy method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a unit price of each filter, evaluating, sequentially, each filter in order of a lowest to a highest unit price, to determine a value for each filter, and changing an ordering of the filters according to the values.An edge-covering based harmonic method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a weight of each filter, evaluating, randomly, each filter having a probability inversely proportionally to its weight, to determine a value, and changing an ordering of the filters according to the values.

    摘要翻译: 用于共享过滤器排序的基于边缘覆盖的贪婪方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的单价,评估 顺序地按每个过滤器按最低到最高单价的顺序,确定每个过滤器的值,并根据该值改变过滤器的排序。 用于共享过滤器排序的基于边缘覆盖的谐波方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的权重, 随机地,每个滤波器具有与其权重成反比的概率,以确定值,并根据该值改变滤波器的排序。

    TEMPLATE-BASED APPROACH FOR WORKLOAD GENERATION
    6.
    发明申请
    TEMPLATE-BASED APPROACH FOR WORKLOAD GENERATION 有权
    基于模板的工作生成方法

    公开(公告)号:US20090327492A1

    公开(公告)日:2009-12-31

    申请号:US12128959

    申请日:2008-05-29

    IPC分类号: G06F15/16

    摘要: A system and method for workload generation include a processor for identifying a workload model by determining each of a hierarchy for workload generation, time scales for workload generation, and states and transitions at each of the time scales, and defining a parameter by determining each of fields for user specific attributes, application specific attributes, network specific attributes, content specific attributes, and a probability distribution function for each of the attributes; a user level template unit corresponding to a relatively slow time scale in signal communication with the processor; an application level template corresponding to a relatively faster time scale in signal communication with the processor; a stream level template corresponding to a relatively fastest time scale in signal communication with the processor; and a communications adapter in signal communication with the processor for defining a workload generating unit responsive to the template units.

    摘要翻译: 用于工作负载生成的系统和方法包括:通过确定工作负载生成的层次结构,工作负载生成的时间标度以及每个时间尺度上的状态和转换来确定工作负载模型的每个处理器,以及通过确定每个 针对用户特定属性的字段,应用特定属性,网络特定属性,内容特定属性以及每个属性的概率分布函数; 用户级模板单元,其对应于与处理器进行信号通信的相对较慢的时标; 应用级模板对应于与处理器进行信号通信的相对较快的时间尺度; 对应于与处理器进行信号通信的相对较快的时标的流级模板; 以及与处理器进行信号通信的通信适配器,用于响应于模板单元来定义工作量生成单元。

    Method for replicating data based on probability of concurrent failure
    8.
    发明授权
    Method for replicating data based on probability of concurrent failure 失效
    基于并发故障概率复制数据的方法

    公开(公告)号:US07480817B2

    公开(公告)日:2009-01-20

    申请号:US11395018

    申请日:2006-03-31

    IPC分类号: G06F11/00

    摘要: A method is provided for replicating data. All nodes coupled to a source node via a network are surveyed to determine candidate replication nodes, and coordinates for each candidate replication node are acquired. The coordinates are used to determine a geographic location of and a communication cost for each candidate replication node. Each geographic location is rated based on probability of a concurrent failure of the source node and the candidate replication node, and a branch-and-bound algorithm is used to assign values to sets of candidate replication nodes based on the communication costs and the ratings. One set of candidate replication nodes is selected based on the assigned values. The data is replicated on the nodes of the selected set of candidate replication nodes, and all nodes coupled to the source node via the network are at least periodically monitored to determine availability of new nodes.

    摘要翻译: 提供了一种用于复制数据的方法。 调查经由网络耦合到源节点的所有节点以确定候选复制节点,并且获取每个候选复制节点的坐标。 坐标用于确定每个候选复制节点的地理位置和通信成本。 基于源节点和候选复制节点的并发故障的概率对每个地理位置进行评估,并且使用分支和边界算法根据通信成本和等级将值分配给候选复制节点的集合。 基于分配的值来选择一组候选复制节点。 数据被复制在所选择的候选复制节点集合的节点上,并且经由网络耦合到源节点的所有节点至少被周期性地监视以确定新节点的可用性。

    SYSTEM AND METHOD FOR CAPACITY SIZING FOR COMPUTER SYSTEMS
    9.
    发明申请
    SYSTEM AND METHOD FOR CAPACITY SIZING FOR COMPUTER SYSTEMS 审中-公开
    用于计算机系统的容量大小的系统和方法

    公开(公告)号:US20080195447A1

    公开(公告)日:2008-08-14

    申请号:US11673118

    申请日:2007-02-09

    IPC分类号: G05B19/418 G06F9/46

    摘要: A system and method for capacity sizing in a computer device or system includes determining one or more classes of operations based on at least one of historical computational usage and predicted usage for a system. Based on the one or more classes of operations, at least one capacity target is set based on the computational usage for each class such that computational capacity is maintained at a set level over a given time period and the set level satisfies at least one usage criterion over the given time period.

    摘要翻译: 一种用于计算机设备或系统中的容量大小化的系统和方法包括基于系统的历史计算使用和预测使用中的至少一个来确定一个或多个类别的操作。 基于一个或多个类别的操作,基于每个类的计算使用来设置至少一个容量目标,使得计算能力在给定时间段内保持在设定电平,并且所述设定电平满足至少一个使用准则 在给定的时间段内。

    Data replica selector
    10.
    发明申请
    Data replica selector 失效
    数据副本选择器

    公开(公告)号:US20070234102A1

    公开(公告)日:2007-10-04

    申请号:US11395018

    申请日:2006-03-31

    IPC分类号: G06F11/00

    摘要: There is provided a method and system for replicating data at another location. The system includes a source node that contains data in a data storage area. The source node is coupled to a network of potential replication nodes. The processor determines at least two eligible nodes in the network of nodes and determines the communication cost associated with a each of the eligible nodes. The processor also determines a probability of a concurrent failure of the source node and each of eligible nodes, and selects at least one of the eligible nodes for replication of the data located on the source node. The selection is based on an the determined communication costs and probability of concurrent failure.

    摘要翻译: 提供了在另一个位置复制数据的方法和系统。 该系统包括在数据存储区域中包含数据的源节点。 源节点耦合到潜在复制节点的网络。 处理器确定节点网络中的至少两个合格节点,并确定与每个合格节点相关联的通信成本。 处理器还确定源节点和每个合格节点的并发故障的概率,并且选择至少一个合格节点用于复制位于源节点上的数据。 该选择基于所确定的通信成本和并发故障的概率。