METHOD AND ARCHITECTURE FOR PROVIDING DATABASE ACCESS CONTROL IN A NETWORK WITH A DISTRIBUTED DATABASE SYSTEM
    1.
    发明公开
    METHOD AND ARCHITECTURE FOR PROVIDING DATABASE ACCESS CONTROL IN A NETWORK WITH A DISTRIBUTED DATABASE SYSTEM 审中-公开
    用分布式数据库系统在网络中提供数据库访问控制的方法和体系结构

    公开(公告)号:EP3320453A1

    公开(公告)日:2018-05-16

    申请号:EP16739373.5

    申请日:2016-07-05

    IPC分类号: G06F17/30 G06F9/46

    摘要: Managing potentially concurrent transactions in a distributed database system includes: maintaining, at a first node, records of transactions executing on one or more nodes, each having a transaction state, execution of a first transaction at a second node including an operation for accessing a first data element stored on the second node and execution of a second transaction at the second node including an operation for accessing the first data element; receiving, at the second node from the first node, a list of transactions including any transactions executing on the second node and having a first transaction state at a time of initiation of the second transaction, and including the first transaction; determining that an outcome of the second transaction depends on an outcome of the first transaction based on the list; and suspending execution of the second transaction until after the first transaction is complete based on the determining.

    METHOD AND ARCHITECTURE FOR PROVIDING DATABASE ACCESS CONTROL IN A NETWORK WITH A DISTRIBUTED DATABASE SYSTEM

    公开(公告)号:EP3882767A1

    公开(公告)日:2021-09-22

    申请号:EP21169145.6

    申请日:2016-07-05

    摘要: A method for a distributed database system includes: maintaining, at a first node, a first plurality of records of transactions, each associated with a transaction and including a start time of the transaction and a start time of an oldest transaction that was active at the start time of the transaction; maintaining, at a second node, a second plurality of records of transactions, including records of completed transactions associated with the second node, each including a transaction start time and a transaction end time; receiving at the second node, a message from the first node including a start time of an oldest transaction that was active at the transaction start time of the oldest currently active transaction in the system; and removing, from the second plurality of records, any records of completed transactions with a transaction end time occurring before the start time of the oldest transaction.