FAULT TOLERANT UPDATE PROPAGATION TO VIEWS
    1.
    发明申请
    FAULT TOLERANT UPDATE PROPAGATION TO VIEWS 审中-公开
    故障传播更新传播

    公开(公告)号:US20100146334A1

    公开(公告)日:2010-06-10

    申请号:US12331737

    申请日:2008-12-10

    IPC分类号: G06F11/14

    CPC分类号: G06F16/2365

    摘要: In a database system, derived data (often called view data or view tables) depends on other data, often called base data (or base tables). When base data on which derived data depends is updated, including changes, additions, and/or deletions, those updates need to be propagated to derived data. Some types of updates, if repeated, result in an incorrect view data state; these updates are termed non-idempotent. To avoid repeating non-idempotent view data updates, signatures are computed that are repeatable, but yet unique to base data on which the view data is based, the view data being updated, and sequence information for updates to the base data (where applicable) and sequence data for multiple changes to the view being updated. The signatures allow detection of view updates that were committed prior to a failure, but which were not confirmed as having been committed to a process that computes the view updates.

    摘要翻译: 在数据库系统中,派生数据(通常称为视图数据或视图表)取决于其他数据,通常称为基础数据(或基本表)。 当派生数据所依赖的基本数据被更新(包括更改,添加和/或删除)时,需要将这些更新传播到派生数据。 某些类型的更新(如果重复)导致查看数据状态不正确; 这些更新被称为非幂等。 为了避免重复非幂等视图数据更新,计算可重复的签名,但对于基于视图数据的基础数据,正在更新的视图数据以及用于基本数据的更新的序列信息(如适用),这些签名是唯一的, 以及用于对要更新的视图进行多次更改的序列数据。 签名允许检测在故障之前提交的视图更新,但未被确认为已被提交到计算视图更新的进程。

    LIGHT-WEIGHT CONCURRENCY CONTROL IN PARALLELIZED VIEW MAINTENANCE
    2.
    发明申请
    LIGHT-WEIGHT CONCURRENCY CONTROL IN PARALLELIZED VIEW MAINTENANCE 审中-公开
    平行视图维护中的轻重力控制

    公开(公告)号:US20100146008A1

    公开(公告)日:2010-06-10

    申请号:US12331842

    申请日:2008-12-10

    IPC分类号: G06F17/30

    CPC分类号: G06F16/24556

    摘要: Aspects relate to maintaining, with a concurrent plurality of view managers, an aggregate view record that is derived from base data being updated. The aggregate view record is stored in a storage device. In a first example, a given base data update is propagated by one of the view managers reading a value from the aggregate view record and a sequence number, determining an updated value using the base data update, and submitting the updated value for writing, with the sequence number. The sequence number submitted with the writing is compared to a then-current sequence number stored in the storage device, and if there is a mismatch, then the view manager repeats the reading, determining, and submitting until there is no mismatch. A number of variations exist for different types of aggregates, which include counting, averaging, summing, and tracking minima and maxima. The concurrency mechanism is more easily scaled than a full ACID transaction model, which blocks both read transactions and write transactions until another transaction completes.

    摘要翻译: 方面涉及通过并发多个视图管理器维护从正被更新的基础数据导出的聚合视图记录。 聚合视图记录存储在存储设备中。 在第一示例中,给定的基本数据更新由其中一个视图管理器从聚合视图记录和序列号中读取值传播,使用基本数据更新确定更新的值,并提交更新后的值用于写入, 序列号。 与写入一起提交的序列号与存储在存储设备中的当前序列号进行比较,如果存在不匹配,则视图管理器重复读取,确定和提交,直到不存在不匹配。 对于不同类型的聚合存在许多变化,包括计数,平均,求和和跟踪最小值和最大值。 并发机制比完整的ACID事务模型更容易扩展,它阻止读取事务和写入事务,直到另一个事务完成。