会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Reduction of message flow between bus-connected consumers and producers
    • 总线连接的消费者和生产者之间的消息流量减少
    • US08392577B2
    • 2013-03-05
    • US13560299
    • 2012-07-27
    • Jun-Jang JengChristian A. LangIoana Stanoi
    • Jun-Jang JengChristian A. LangIoana Stanoi
    • G06F15/173
    • H04L12/40H04L12/4013
    • A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. The logical operator is pinned to the given physical processing node. The pinning prevents any subsequent reassignment of the logical operator to another physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus. A determination is made as to whether at least one logical operating in the plurality of logical operators needs to be reassigned to a different physical processing node. The at least one logical operator is reassigned to the different physical processing node.
    • 公开了一种用于减少消息总线上的消息流的系统,方法和计算机可读介质。 该方法包括确定多个逻辑运算符中的至少一个逻辑运算符是否需要对一组物理节点中的给定物理处理节点进行处理。 逻辑运算符被固定到给定的物理处理节点。 钉扎可防止任何后续的逻辑运算符重新分配到另一个物理处理节点。 多个逻辑运算符中的每个逻辑运算符被分配给消息总线上的物理处理节点组中的初始物理处理节点。 确定是否需要将多个逻辑运算符中的至少一个逻辑运算重新分配给不同的物理处理节点。 至少一个逻辑运算符被重新分配给不同的物理处理节点。
    • 3. 发明申请
    • REDUCTION OF MESSAGE FLOW BETWEEN BUS-CONNECTED CONSUMERS AND PRODUCERS
    • 减少总线连接消费者和生产者之间的消息流量
    • US20120297085A1
    • 2012-11-22
    • US13560299
    • 2012-07-27
    • Jun-Jang JENGChristian A. LANGIoana STANOI
    • Jun-Jang JENGChristian A. LANGIoana STANOI
    • G06F15/16
    • H04L12/40H04L12/4013
    • A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. The logical operator is pinned to the given physical processing node. The pinning prevents any subsequent reassignment of the logical operator to another physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus. A determination is made as to whether at least one logical operating in the plurality of logical operators needs to be reassigned to a different physical processing node. The at least one logical operator is reassigned to the different physical processing node.
    • 公开了一种用于减少消息总线上的消息流的系统,方法和计算机可读介质。 该方法包括确定多个逻辑运算符中的至少一个逻辑运算符是否需要对一组物理节点中的给定物理处理节点进行处理。 逻辑运算符被固定到给定的物理处理节点。 钉扎可防止任何后续的逻辑运算符重新分配到另一个物理处理节点。 多个逻辑运算符中的每个逻辑运算符被分配给消息总线上的物理处理节点组中的初始物理处理节点。 确定是否需要将多个逻辑运算符中的至少一个逻辑运算重新分配给不同的物理处理节点。 至少一个逻辑运算符被重新分配给不同的物理处理节点。
    • 4. 发明授权
    • System and method for executing multiple concurrent index-driven table access operations
    • 用于执行多个并发索引驱动的表访问操作的系统和方法
    • US08200645B2
    • 2012-06-12
    • US11859405
    • 2007-09-21
    • Bishwaranjan BhattacharjeeChristian A. LangTimothy R. Malkemus
    • Bishwaranjan BhattacharjeeChristian A. LangTimothy R. Malkemus
    • G06F7/00G06F17/00G06F17/30
    • G06F17/30336G06F17/30595
    • An index scan processor and method to perform concurrent scans of stored indexed data. An indexed data scanner performs a first scan of stored data by sequentially scanning through an index data structure and maintains, over a duration of the first scan, a first scan current scan location within the index data structure that indicates a currently accessed record within the stored data structure for the first scan. A scan manager accepts a request for a second scan of the stored data, determines, during the performing the first scan, a starting index scan location within the index data structure for the second scan that is sufficiently near the first scan current index scan location to cause records indicated by the starting location index to be stored within a buffer due to the performing the first scan, and starts the second scan at the starting location and proceeding to the second end key.
    • 索引扫描处理器和方法,用于执行存储的索引数据的并发扫描。 索引数据扫描器通过依次扫描索引数据结构来对存储的数据进行第一次扫描,并且在第一次扫描的持续时间内维持索引数据结构内的第一扫描当前扫描位置,其指示所存储的当前访问的记录 第一次扫描的数据结构。 扫描管理器接受对所存储的数据进行第二次扫描的请求,在执行第一次扫描期间确定第二次扫描的索引数据结构内的起始索引扫描位置,其足够靠近第一扫描当前索引扫描位置到 由起始位置索引指示的记录由于执行第一次扫描而被存储在缓冲器内,并且在起始位置开始第二次扫描,并进行到第二个结束键。
    • 7. 发明授权
    • Multi-granularity hierarchical aggregate selection based on update, storage and response constraints
    • 基于更新,存储和响应约束的多粒度分层聚合选择
    • US08719295B2
    • 2014-05-06
    • US13169514
    • 2011-06-27
    • Yuan-Chi ChangLawrence KovedChristian A. LangIgor Sominsky
    • Yuan-Chi ChangLawrence KovedChristian A. LangIgor Sominsky
    • G06F7/00G06F17/30
    • G06F17/30551G06F17/30489
    • Techniques are disclosed for multi-granularity hierarchical aggregate selection based on update, storage and response constraints. For example, for a temporal hierarchy of aggregation statistics associated with a plurality of database records, wherein the temporal hierarchy comprises two or more aggregation statistics levels and each level has a different temporal granularity associated therewith, a method comprises iteratively modifying the temporal hierarchy to at least one of: (a) minimize a storage usage cost while satisfying a temporal hierarchy update constraint and a query response time constraint; (b) reduce a temporal hierarchy update time and a query response time while satisfying a storage usage constraint; and (c) minimize a query response time for frequently applied queries that do not shift in time while satisfying the storage usage constraint, wherein the resulting temporal hierarchy that achieves at least one of (a), (b) and (c) is identified as an optimal temporal hierarchy.
    • 公开了基于更新,存储和响应约束的多粒度分级聚合选择的技术。 例如,对于与多个数据库记录相关联的聚合统计的时间层级,其中时间层级包括两个或多个聚合统计级别,并且每个级别具有与之相关联的不同时间粒度,一种方法包括将时间层级迭代地修改为 至少一个:(a)在满足时间层次更新约束和查询响应时间约束的同时最小化存储使用成本; (b)在满足存储使用限制的同时减少时间层次更新时间和查询响应时间; (c)最小化在满足存储使用限制的同时不随时间移动的频繁应用的查询的查询响应时间,其中识别达到(a),(b)和(c)中的至少一个的所得到的时间层级, 作为最优时间层级。