KEEPING STABLE LEADERSHIP IN RAFT-BASED PROTOCOL WITH FAST AUTOMATIC FAILOVER

    公开(公告)号:US20240134879A1

    公开(公告)日:2024-04-25

    申请号:US18227288

    申请日:2023-07-27

    CPC classification number: G06F16/27

    Abstract: A node within a group of participant nodes begins an election by sending a vote request to the other nodes in the group. The vote request sets an input term argument to a future term value without incrementing the actual current term value. The current term value at each participant node is only incremented in response to a successful leadership change. At startup time, a candidate node issues a vote request with a non-disruptive election type. An established leader automatically rejects a non-disruptive vote request. A heartbeat loss vote request is rejected by each receiving node if its own heartbeat timeout does not exceed a predetermined limit. A mandatory vote request informs the leader node that it should stop requesting new workload. This is used in manual leadership transition to make sure that the old leader does not accept new transactions during the leadership transition.

    SYSTEM AND METHOD FOR PROVIDING ACCESS TO A SHARDED DATABASE USING A CACHE AND A SHARD TECHNOLOGY
    6.
    发明申请
    SYSTEM AND METHOD FOR PROVIDING ACCESS TO A SHARDED DATABASE USING A CACHE AND A SHARD TECHNOLOGY 审中-公开
    使用高速缓存和削减技术提供访问受保护数据库的系统和方法

    公开(公告)号:US20160306832A1

    公开(公告)日:2016-10-20

    申请号:US15133979

    申请日:2016-04-20

    Abstract: In accordance with an embodiment, the system enables access to a sharded database using a cache and a shard topology. A shard-aware client application connecting to a sharded database can use a connection pool (e.g., a Universal Connection Pool, UCP), to store or access connections to different shards or chunks of the sharded database within a shared pool. As new connections are created, a shard topology layer can be built at the database driver layer, which learns and caches shard key ranges to locations of shards. The shard topology layer enables subsequent connection requests from a client application to use a fast key path access to the appropriate shard or chunk.

    Abstract translation: 根据实施例,该系统使得能够使用高速缓存和分片拓扑来访问分片数据库。 连接到分片数据库的分片识别客户端应用程序可以使用连接池(例如,通用连接池,UCP)来存储或访问到共享池内的分片数据库的不同碎片或块的连接。 当创建新连接时,可以在数据库驱动程序层构建分片拓扑图层,数据库驱动程序层可以将分片键范围学习并缓存到分片的位置。 分片拓扑层使来自客户端应用程序的后续连接请求能够使用快速键路径访问适当的分片或块。

    Providing services across systems that manage distributed replicas
    7.
    发明授权
    Providing services across systems that manage distributed replicas 有权
    在管理分布式副本的系统之间提供服务

    公开(公告)号:US09268840B2

    公开(公告)日:2016-02-23

    申请号:US14448987

    申请日:2014-07-31

    CPC classification number: G06F17/30595 H04L41/02 H04L67/1002

    Abstract: Techniques are provided to allow users to define a global service that is offered across multiple replicated databases. Database clients connect to and use a global service just as they do with regular services on a single database today. Upon receiving a connection request, a collection of components, referred to collectively as the Global Data Service framework (GDS framework), automatically chooses the best database server instances to which to connect a client. Once those connections have been established, the clients determine which database server instance, of those database server instances to which they are connected, to send requests to based, at least in part, on advisory messages sent to the clients by the GDS framework.

    Abstract translation: 提供技术以允许用户定义跨多个复制数据库提供的全局服务。 数据库客户端连接到并使用全局服务,就像现在一个数据库上的常规服务一样。 一旦接收到连接请求,将统称为全局数据服务框架(GDS框架)的组件集合自动选择连接客户端的最佳数据库服务器实例。 一旦建立了这些连接,客户端将确定哪些数据库服务器实例(与其连接的数据库服务器实例)发送请求至少部分地基于由GDS框架发送给客户端的咨询消息。

    Fine-Grained Custom Sharding Of Databases
    8.
    发明公开

    公开(公告)号:US20240273077A1

    公开(公告)日:2024-08-15

    申请号:US18400412

    申请日:2023-12-29

    CPC classification number: G06F16/2282 G06F16/27

    Abstract: Under dynamic shard mapping, applications may dynamically define, evolve, and redefine how a sharded table is sharded across shards according to sharding keys. Dynamic shard mapping is referred to as being dynamic because changes to a sharding directory that defines a sharding distribution scheme are effected without having to change synchronized f metadata. A sharding directory maps sharding key values to shard servers. The changes are effected directly by invoking an API or indirectly by submitting a DML command that includes, for example, a sharding key value that is unmapped by the sharding directory. The sharding directory is distributed among the shards and client computers of a sharded DBMS to facilitate and optimize the routing of database commands across the shards of a DBMS.

    RECOVERY FROM LOSS OF LEADER DURING ASYNCHRONOUS DATABASE TRANSACTION REPLICATION

    公开(公告)号:US20240126783A1

    公开(公告)日:2024-04-18

    申请号:US18372006

    申请日:2023-09-22

    CPC classification number: G06F16/273 G06F11/1469 G06F16/2379 G06F2201/80

    Abstract: A lead-sync log record is used to synchronize the replication logs of follower shards to the leader shard. In response to a failure to determine that there is a consensus for a database transaction commit operation after a shard server becomes a new leader, the new leader shard performs a sync operation using the lead-sync log record to synchronize replication logs of the follower shards to the replication log of the new leader. A shard server identifies a first transaction having a first log record but not a post-commit log record in the replication log, defines a recovery window in the replication log starting at the first log record of the identified first transaction and ending at the lead-sync log record, identifies a set of transactions to be recovered, and performs a recovery action on the set of transactions to be recovered.

Patent Agency Ranking