Efficient determination of committed changes

    公开(公告)号:US10248685B2

    公开(公告)日:2019-04-02

    申请号:US15253626

    申请日:2016-08-31

    Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.

    FRAMEWORK FOR VOLATILE MEMORY QUERY EXECUTION IN A MULTI NODE CLUSTER
    15.
    发明申请
    FRAMEWORK FOR VOLATILE MEMORY QUERY EXECUTION IN A MULTI NODE CLUSTER 审中-公开
    在多节点群集中进行易失性存储器查询执行的框架

    公开(公告)号:US20160026684A1

    公开(公告)日:2016-01-28

    申请号:US14805949

    申请日:2015-07-22

    Abstract: Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve receiving a query that requires work to be performed on data that resides in a plurality of on disk extents. A parallel query coordinator that is aware of the in-memory distribution divides the work into granules that align with the in-memory separation. The parallel query coordinator then sends each granule to the database server instance with local in memory access to the data required by the granule and aggregates the results to respond to the query.

    Abstract translation: 这里描述了用于执行已经分离成块并且分布在群集数据库系统中的多个节点的易失性存储器上的数据库对象的不同部分的技术。 这些技术涉及接收需要对位于多个磁盘盘区上的数据执行工作的查询。 意识到内存分配的并行查询协调器将工作分成与内存分离对齐的颗粒。 并行查询协调器然后将每个粒子发送到数据库服务器实例,并使用本地内存访问粒子所需的数据,并聚合结果以响应查询。

    DISTRIBUTION OF AN OBJECT IN VOLATILE MEMORY ACROSS A MULTI-NODE DATABASE
    16.
    发明申请
    DISTRIBUTION OF AN OBJECT IN VOLATILE MEMORY ACROSS A MULTI-NODE DATABASE 有权
    通过多节点数据库在易失性存储器中分配对象

    公开(公告)号:US20160026660A1

    公开(公告)日:2016-01-28

    申请号:US14565906

    申请日:2014-12-10

    Abstract: Techniques are described herein for distributing distinct portions of a database object across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve establishing a single database server instance located on a node in a multi-node cluster as a load-operation master for a particular data set. The load-operation master determines how the data set may be separated into chunks using a hash function. The load-operation master then broadcasts a small payload of consistency information to other database servers, so each database server may independently execute the hash function and independently load their respectively assigned chunks of data.

    Abstract translation: 这里描述了用于在集群数据库系统中的多个节点的易失性存储器之间分布数据库对象的不同部分的技术。 该技术涉及将位于多节点集群中的节点上的单个数据库服务器实例设置为用于特定数据集的加载操作主机。 加载操作主机确定数据集如何使用散列函数分成块。 然后,负载操作主机向其他数据库服务器广播一小部分一致性信息,因此每个数据库服务器可以独立地执行散列函数并独立地加载其分配的数据块。

    Space management for transactional consistency of in-memory objects on a standby database

    公开(公告)号:US10747752B2

    公开(公告)日:2020-08-18

    申请号:US15892677

    申请日:2018-02-09

    Abstract: Embodiments store transaction metadata in dedicated pools of allocated memory chunks. Portions of the pools of allocated memory chunks are dedicated to the respective apply slave processes that mine and process change records. Also, the pools of allocated memory chunks are anchored within the structure of a transaction log such that buffering and application of metadata for one transaction does not block required buffering and application of metadata for other transactions. The standby database system pre-processes transaction metadata in preparation for application of the metadata to invalidate appropriate portions of MF data. Further, embodiments divide the work of pre-processing invalidation records among the many apply slave processes that record the invalidation records. A garbage collection selects memory chunks for garbage collection in reverse order of how the chunks were allocated. Also, a deduplication algorithm ensures that typically only a single invalidation message per block is applied to invalidate MF data.

    Framework for volatile memory query execution in a multi node cluster

    公开(公告)号:US10275184B2

    公开(公告)日:2019-04-30

    申请号:US14805949

    申请日:2015-07-22

    Abstract: Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve receiving a query that requires work to be performed on data that resides in a plurality of on disk extents. A parallel query coordinator that is aware of the in-memory distribution divides the work into granules that align with the in-memory separation. The parallel query coordinator then sends each granule to the database server instance with local in memory access to the data required by the granule and aggregates the results to respond to the query.

Patent Agency Ranking