PRIORITIZING REPOPULATION OF IN-MEMORY COMPRESSION UNITS
    71.
    发明申请
    PRIORITIZING REPOPULATION OF IN-MEMORY COMPRESSION UNITS 有权
    内存压缩单元的重新排列

    公开(公告)号:US20160085834A1

    公开(公告)日:2016-03-24

    申请号:US14823393

    申请日:2015-08-11

    CPC classification number: G06F17/30339 G06F17/30377 G06F17/30578

    Abstract: To prioritize repopulation of in-memory compression units (IMCU), a database server compresses, into an IMCU, a plurality of data units from a database table. In response to changes to any of the plurality of data units within the database table, the database server performs the steps of: (a) invalidating corresponding data units in the IMCU; (b) incrementing an invalidity counter of the IMCU that reflects how many data units within the IMCU have been invalidated; (c) receiving a data request that targets one or more of the plurality of data units of the database table; (d) in response to receiving the data request, incrementing an access counter of the IMCU; and (e) determining a priority for repopulating the IMCU based, at least in part, on the invalidity counter and the access counter.

    Abstract translation: 为了优先重新填充内存中的压缩单元(IMCU),数据库服务器从数据库表将多个数据单元压缩到IMCU中。 响应于对数据库表内的多个数据单元中的任一个的改变,数据库服务器执行以下步骤:(a)使IMCU中的相应数据单元无效; (b)增加反映IMCU内有多少数据单位无效的IMCU的无效计数器; (c)接收针对所述数据库表的所述多个数据单元中的一个或多个的数据请求; (d)响应于接收到数据请求,递增IMCU的访问计数器; 以及(e)至少部分地基于无效计数器和访问计数器确定重新填充IMCU的优先级。

    Reduced disk space standby
    72.
    发明授权
    Reduced disk space standby 有权
    减少磁盘空间待机

    公开(公告)号:US09146934B2

    公开(公告)日:2015-09-29

    申请号:US14072739

    申请日:2013-11-05

    Abstract: A method and system for replicating database data is provided. One or more standby database replicas can be used for servicing read-only queries, and the amount of storage required is scalable in the size of the primary database storage. One technique is described for combining physical database replication to multiple physical databases residing within a common storage system that performs de-duplication. Having multiple physical databases allows for many read-only queries to be processed, and the de-duplicating storage system provides scalability in the size of the primary database storage. Another technique uses one or more diskless standby database systems that share a read-only copy of physical standby database files. Notification messages provide consistency between each diskless system's in-memory cache and the state of the shared database files. Use of a transaction sequence number ensures that each database system only accesses versions of data blocks that are consistent with a transaction checkpoint.

    Abstract translation: 提供了一种用于复制数据库数据的方法和系统。 一个或多个备用数据库副本可用于维护只读查询,并且所需的存储量可在主数据库存储的大小上扩展。 描述了一种将物理数据库复制与驻留在执行重复数据删除的公共存储系统中的多个物理数据库进行组合的技术。 拥有多个物理数据库可以处理许多只读查询,并且重复存储系统提供主数据库存储大小的可扩展性。 另一种技术使用一个或多个共享物理备用数据库文件的只读副本的无盘备用数据库系统。 通知消息提供每个无盘系统的内存缓存与共享数据库文件的状态之间的一致性。 使用事务序列号确保每个数据库系统只能访问与事务检查点一致的数据块版本。

    Rapid Recovery From Downtime Of Mirrored Storage Device
    74.
    发明申请
    Rapid Recovery From Downtime Of Mirrored Storage Device 审中-公开
    镜像存储设备停机时间快速恢复

    公开(公告)号:US20140281272A1

    公开(公告)日:2014-09-18

    申请号:US13801319

    申请日:2013-03-13

    Abstract: No-loss rapid recovery performs resynchronization efficiently while concurrently allowing availability to mirrored data on the storage device. No-loss rapid recovery has two stages and involves storage devices that have both a non-volatile cache and primary storage and that operate as mirror buddies. The first stage is referred to herein as the buddy-retention stage. During the buddy-retention stage, writes to mirrored data are not performed on the offline mirror buddy but are performed on the online mirror buddy. The mirrored data changed in the online mirrored buddy is retained in the non-volatile cache of the retention buddy. The next stage is referred to herein as the rapid resynchronization stage. In this stage, the changed mirrored data retained by the retention buddy for no-loss rapid recovery is used to resynchronize the offline buddy. The storage device is resynchronized using the changed mirrored data retained in the cache of the mirror buddy.

    Abstract translation: 无损失快速恢复有效地执行重新同步,同时允许可用性在存储设备上镜像数据。 无损快速恢复有两个阶段,涉及具有非易失性缓存和主存储并且作为镜像伙伴操作的存储设备。 第一阶段在本文中称为保留阶段。 在好友保留期间,对镜像数据的写入不会在离线镜像伙伴上执行,而是在在线镜像伙伴上执行。 在线镜像伙伴中更改的镜像数据保留在保留伙伴的非易失性缓存中。 下一阶段在本文中被称为快速再同步化阶段。 在这个阶段,由保留伙伴保留的无损失快速恢复所更改的镜像数据用于重新同步脱机伙伴。 使用保留在镜像伙伴缓存中的已更改的镜像数据重新同步存储设备。

    GENERATING AND APPLYING REDO RECORDS
    75.
    发明申请
    GENERATING AND APPLYING REDO RECORDS 有权
    生成和应用REDO记录

    公开(公告)号:US20140067767A1

    公开(公告)日:2014-03-06

    申请号:US14073832

    申请日:2013-11-06

    CPC classification number: G06F11/1474 G06F17/30

    Abstract: Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to storage as a result of the merge operation.

    Abstract translation: 提供了维护级联索引的技术。 在一种方法中,一个或多个分支节点压缩技术被应用于级联索引的主索引。 在一种方法中,生成Bloom过滤器并与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值,例如在与分支节点相关联的叶片块中。 在一种方法中,响应于级联索引的两个级别之间的合并操作,生成新的重做记录。 新的重做记录包括(a)受合并操作影响的块的一个或多个地址,(b)数据被“下推”到级联索引的较低级,以及(c)一个或多个地址 作为合并操作的结果写入存储器的块。

Patent Agency Ranking