1. A container, comprising:
a receptacle having walls, a floor, and an open end;
a cover pivotally attached to one of the walls of the receptacle, the cover having at least one tab extending from its inner surface and being movable between an open position, in which the open end of the receptacle can be accessed, and a closed position, in which the cover overlies the open end of the receptacle;
at least one locking receptacle mounted on one of the cover and one or more of the receptacle walls;
a locking system for maintaining the cover in the closed position, the locking system mounted on the other of the cover and the one or more of the receptacle walls, comprising:
a carrier member having at least one locking member extending from the carrier member, the carrier member being movable between a first locked position in which the at least one locking member engages the at least one locking receptacle to maintain the cover in the closed position and a second unlocked position in which the at least one locking member disengages from the at least one locking receptacle and the cover is movable between the closed and the open position,
wherein the at least one tab is disposed adjacent the at least one locking member so that the at least one tab is disposed between the at least one locking member and the at least one locking receptacle wherein both the at least one locking member and the at least one tab are disposed in the at least one locking receptacle.
2. The container of claim 1, the locking mechanism further comprising a locking indicator assembly having an indicium on an external portion of the container and a movable member connected to the carrier member to move the carrier member between the first locked position and second unlocked position, wherein the movable member overlies the indicium when the carrier member is in at least one of the first locked position and the second unlocked position.
3. The container of claim 1, wherein the at least one locking member is disposed within an outer perimeter of the at least one tab in the second unlocked position and has a first portion that extends beyond the outer perimeter of the at least one tab when in the first locked position.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A computer-implemented method, the method comprising:
providing a transaction master for each of a plurality of transactions of a database, wherein each transaction master is configured to communicate with at least one transaction slave to manage execution of a transaction in the plurality of transactions, each transaction master configured to perform operations comprising:
receiving a request to commit the transaction;
initiating, based on the request, a two-phase commit operation to commit the transaction, wherein the two-phase commit operation comprises preparing for committing the transaction and writing a committed transaction to a memory;
optimizing the two-phase commit operation by omitting the writing of the committed transaction to the memory; and
generating an acknowledgement of the committed transaction.
2. The computer-implemented method according to claim 1, wherein the generating the acknowledgement comprises generating an early acknowledgement of the committed transaction.
3. (canceled)
4. (canceled)
5. The computer-implemented method according to claim 1, wherein the omitting the writing of the committed transaction further comprises:
determining a log sequence number corresponding to the transaction;
comparing the log sequence number corresponding to the transaction to a log sequence number stored on a disk of the database; and
omitting the writing of the committed transaction based on the comparing.
6. (canceled)
7. (canceled)
8. The computer-implemented method according to claim 22, further comprising obtaining the transaction token corresponding to the committed transaction based on a commit identifier corresponding to the transaction.
9. A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one programmable processor, causes the at least one programmable processor to perform operations comprising:
providing a transaction master for each of a plurality of transactions of a database, wherein each transaction master is configured to communicate with at least one transaction slave to manage execution of a transaction in the plurality of transactions, each transaction master configured to perform operations comprising:
receiving a request to commit the transaction;
initiating, based on the request, a two-phase commit operation to commit the transaction, wherein the two-phase commit operation comprises preparing for committing the transaction and writing a committed transaction to a memory;
optimizing the two-phase commit operation by omitting the writing of the committed transaction to the memory; and
generating an acknowledgement of the committed transaction.
10. The computer program product according to claim 9, wherein the generating the acknowledgement comprises generating an early acknowledgement of the committed transaction.
11. (canceled)
12. (canceled)
13. The computer program product according to claim 9, wherein the omitting the writing of the committed transaction further comprises:
determining a log sequence number corresponding to the transaction;
comparing the log sequence number corresponding to the transaction to a log sequence number stored on a disk of the database; and
omitting the writing of the committed transaction based on the comparing.
14. (canceled)
15. (canceled)
16. A system comprising:
at least one programmable processor; and
a non-transitory machine-readable medium storing instructions that, when executed by the at least one programmable processor, causes the at least one programmable processor to perform operations comprising:
providing a transaction master for each of a plurality of transactions of a database, wherein each transaction master is configured to communicate with at least one transaction slave to manage execution of a transaction in the plurality of transactions, each transaction master configured to perform operations comprising:
receiving a request to commit the transaction;
initiating, based on the request, a two-phase commit operation to commit the transaction, wherein the two-phase commit operation comprises preparing for committing the transaction and writing a committed transaction to a memory;
optimizing the two-phase commit operation by omitting the writing of the committed transaction to the memory; and
generating an acknowledgement of the committed transaction.
17. The system according to claim 16, wherein the generating the acknowledgement comprises generating an early acknowledgement of the committed transaction.
18. (canceled)
19. (canceled)
20. The system according to claim 16, wherein the omitting the writing of the committed transaction further comprises:
determining a log sequence number corresponding to the transaction;
comparing the log sequence number corresponding to the transaction to a log sequence number stored on a disk of the database; and
omitting the writing of the committed transaction based on the comparing.
21. The computer-implemented method according to claim 5, wherein the writing of the committed transaction is omitted when the log sequence number of the disk is larger than the log sequence number corresponding to the transaction.
22. The computer-implemented method according to claim 1, further comprising:
generating a transaction token to specify data to be visible for a transaction on the database, the transaction token including a transaction identifier for identifying whether the transaction is a committed transaction or an uncommitted transaction; and
executing the plurality of transactions of the database with each transaction master.
23. The computer program product according to claim 13, wherein the writing of the committed transaction is omitted when the log sequence number of the disk is larger than the log sequence number corresponding to the transaction.
24. The computer program product according to claim 9, further comprising:
generating a transaction token to specify data to be visible for a transaction on the database, the transaction token including a transaction identifier for identifying whether the transaction is a committed transaction or an uncommitted transaction; and
executing the plurality of transactions of the database with each transaction master.
25. The system according to claim 20, wherein the writing of the committed transaction is omitted when the log sequence number of the disk is larger than the log sequence number corresponding to the transaction.
26. The system according to claim 16, further comprising:
generating a transaction token to specify data to be visible for a transaction on the database, the transaction token including a transaction identifier for identifying whether the transaction is a committed transaction or an uncommitted transaction; and
executing the plurality of transactions of the database with each transaction master.