会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Pipeline optimization based on polymorphic schema knowledge
    • 基于多态模式知识的管道优化
    • US08161380B2
    • 2012-04-17
    • US12147408
    • 2008-06-26
    • Amir Bar-OrMichael James Beckerle
    • Amir Bar-OrMichael James Beckerle
    • G06F17/00
    • G06F17/227G06F17/2247
    • Provided are techniques for pipeline optimization based on polymorphic schema knowledge. A hierarchical document to be processed by a pipeline of transformations is received. It is determined whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the input schema is a polymorphic schema. In response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, data items corresponding to each schema node that the next downstream transformation is not accessing are collected into a single compressed event. The collected items are passed to the next downstream transformation as the single compressed event.
    • 提供了基于多态模式知识的管道优化技术。 接收要由转换流水线处理的分层文档。 确定下一个下游变换是否访问相关联的输入模式中的每个模式节点的内容,其中输入模式是多态模式。 响应于确定下一个下游转换未访问相关联的输入模式中的每个模式节点的内容,对应于下一个下游转换未访问的每个模式节点的数据项被收集到单个压缩事件中。 收集的项目作为单个压缩事件传递到下一个下游转换。
    • 2. 发明授权
    • Asynchronous data structure pull application programming interface (API) for stream systems
    • 异步数据结构为流系统提取应用程序编程接口(API)
    • US08141080B2
    • 2012-03-20
    • US11848098
    • 2007-08-30
    • Amir Bar-OrMichael James Beckerle
    • Amir Bar-OrMichael James Beckerle
    • G06F9/46
    • G06F9/4881
    • Provided are techniques for processing data items. A limit on the number of dequeue operations allowed in a current step of processing for a queue-like data structure is set, wherein the number of allowed dequeue operations limit at least one of an amount of CPU resources and an amount of memory resources to be used by an operator. The operator to perform processing is selected and the operator is activated by passing control to the operator, which then dequeues data constrained by the limits set. In response to receiving control back from the operator, the data structure size is examined to determine whether the operator made forward progress in that the operator enqueued or dequeued at least one data item.
    • 提供了用于处理数据项的技术。 设置当前对队列状数据结构进行处理的允许出队次数的限制,其中允许出队次数的操作将CPU资源量和存储器资源量中的至少一个限制为 由运营商使用 选择执行处理的操作者,并且通过将控制传递给操作者来激活操作者,然后操作者将限制的数据排队。 响应于从操作员接收到控制,检查数据结构大小以确定操作者是否已经取得进展,因为操作员将至少一个数据项排队或出队。
    • 5. 发明申请
    • Method and apparatus for refreshing materialized views
    • 刷新物化视图的方法和装置
    • US20050091180A1
    • 2005-04-28
    • US10690762
    • 2003-10-22
    • Nitzan PelegAmir Bar-orYuval ShermanEdward Bortnikov
    • Nitzan PelegAmir Bar-orYuval ShermanEdward Bortnikov
    • G06F7/00G06F17/30
    • G06F16/2393
    • The disclosed embodiments relate to a system and method for refreshing a materialized view that is at least in part derived from a table. The system may be adapted to provide availability of the table and the materialized view while the materialized view is being refreshed. The system may include a refresh log that contains a plurality of entries, each of the plurality of entries corresponding to a change in the table, each of the plurality of entries comprising an epoch identifier. The system may also include a refresh manager that performs a refresh operation on the materialized view in multiple steps by (a) successively reading a first subset of the plurality of entries indicated by a specific epoch identifier from the refresh log, (b) identifying a second subset of the plurality of entries from within the first subset of the plurality of entries, the second subset of the plurality of entries falling within a primary key value boundary and (c) applying the second subset of the plurality of entries to the materialized view.
    • 所公开的实施例涉及用于刷新至少部分地从表导出的物化视图的系统和方法。 该系统可以适于在物质化视图被刷新的同时提供表的可用性和物化视图。 系统可以包括包含多个条目的刷新日志,多个条目中的每个条目对应于表中的改变,多个条目中的每个条目包括历元标识符。 该系统还可以包括刷新管理器,该刷新管理器通过以下步骤在多个步骤中对物化视图执行刷新操作:(a)从刷新日志连续读取由特定历元标识符指示的多个条目的第一子集,(b) 在多个条目的第一子集内的多个条目的第二子集,多个条目的第二子集落入主键值边界内,并且(c)将多个条目的第二子集应用于物化视图 。
    • 8. 发明申请
    • PIPELINE OPTIMIZATION BASED ON POLYMORPHIC SCHEMA KNOWLEDGE
    • 基于多边形方法知识的管道优化
    • US20090327870A1
    • 2009-12-31
    • US12147408
    • 2008-06-26
    • Amir BAR-ORMichael James BECKERLE
    • Amir BAR-ORMichael James BECKERLE
    • G06F17/00
    • G06F17/227G06F17/2247
    • Provided are techniques for pipeline optimization based on polymorphic schema knowledge. A hierarchical document to be processed by a pipeline of transformations is received. It is determined whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the input schema is a polymorphic schema. In response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, data items corresponding to each schema node that the next downstream transformation is not accessing are collected into a single compressed event. The collected items are passed to the next downstream transformation as the single compressed event.
    • 提供了基于多态模式知识的管道优化技术。 接收要由转换流水线处理的分层文档。 确定下一个下游变换是否访问相关联的输入模式中的每个模式节点的内容,其中输入模式是多态模式。 响应于确定下一个下游转换未访问相关联的输入模式中的每个模式节点的内容,对应于下一个下游转换未访问的每个模式节点的数据项被收集到单个压缩事件中。 收集的项目作为单个压缩事件传递到下一个下游转换。
    • 10. 发明授权
    • Optimization model for processing hierarchical data in stream systems
    • 在流系统中处理分层数据的优化模型
    • US07860863B2
    • 2010-12-28
    • US11850588
    • 2007-09-05
    • Amir Bar-OrMichael James Beckerle
    • Amir Bar-OrMichael James Beckerle
    • G06F7/00
    • G06F8/433
    • Provided are techniques for optimizing the processing of hierarchical data. A linear processing graph is received, wherein the linear processing graph includes a plurality of operators, wherein each operator in the plurality is connected to at least one other operator by an arc, wherein hierarchical data flows on arcs, wherein the operators read and replace identified subregions within the hierarchical data flowing into the operators on the arcs, and wherein the operators do not modify the hierarchical data outside of these identified subregions. For each operator in the linear processing graph, a minimal set of dependent upstream operators on which that operator depends is found by examining how the identified subregions are created in the linear processing graph through obtaining a set of operators on which that operator depends, by analyzing dependencies carried by a set of vector nodes of the hierarchical data in an input schema of the operator, and, for each of the vector nodes, by analyzing an associated set of scalar nodes, wherein finding the minimum set of operators includes taking into consideration data preservation characteristics of the plurality of operators and taking into consideration structural-order preservation characteristics of the plurality of operators. The linear processing graph is rewritten to create a new graph that expresses dependencies based on the minimal set of dependent upstream operators for each operator.
    • 提供了用于优化分层数据的处理的技术。 接收线性处理图,其中线性处理图包括多个运算符,其中多个运算符中的每个运算符通过弧连接到至少一个其他运算符,其中分层数据在弧上流动,其中运算符读取并替换识别出的 分层数据中的子区域流入弧中的运算符,并且其中运算符不修改在这些确定的子区域之外的分层数据。 对于线性处理图中的每个运算符,通过检查在线性处理图中如何创建识别的子区域,找到操作符所依赖的最小的依赖上游运算符集,通过分析获得运算符所依赖的一组运算符 由运算符的输入模式中的分层数据的一组矢量节点携带的依赖关系,以及通过分析相关联的一组标量节点,对于每个向量节点,其中找到最小的运算符组包括考虑数据 并考虑到多个操作者的结构顺序保存特性。 线性处理图被重写以创建一个基于每个运算符的依赖上游运算符的最小集合来表示依赖关系的新图。