Disclosed herein are system, method, and computer program product embodiments for providing a lock-free read access to one or more data structures. An embodiment operates by allocating a first portion of a memory corresponding to a first data structure of the one or more data structures, the first data structure comprising a size. The embodiment then performs a first operation associated with the first data structure. The embodiment then receives a first request to insert second data to the first data structure, and determines whether an increase of the size is to be executed. The embodiment then, based on the determination that an increase of the size is to be executed, inserting the second data to a modified first data structure, comprising: executing garbage collection to free-up the first portion of the memory based on at least one parallel operation associated with the first data structure.
Legal claims defining the scope of protection, as filed with the USPTO.
2. The computer-implemented method of claim 1, wherein the database system comprises a transaction manager and a clean-up manager.
4. The computer-implemented method of claim 3, further comprising attaching the clean-up entry to a next subsequent transaction in response to determining that the time is not less than the most-recent minimum read timestamp.
5. The computer-implemented method of claim 3, wherein the most-recent minimum read timestamp is a lowest read timestamp of all executing transactions in the database system.
6. The computer-implemented method of claim 3, wherein the time is equal to a commit timestamp of a last-committed parallel transaction.
9. The computing system of claim 8, wherein the database system comprises a transaction manager and a clean-up manager.
11. The computing system of claim 10, the operations further comprising attaching the clean-up entry to a next subsequent transaction in response to determining that the time is not less than the most-recent minimum read timestamp.
12. The computing system of claim 10, wherein the most-recent minimum read timestamp is a lowest read timestamp of all executing transactions in the database system.
13. The computing system of claim 10, wherein the time assigned to the clean-up entry is equal to a commit timestamp of a last-committed parallel transaction.
16. The non-transitory computer-readable medium of claim 15, wherein the database system comprises a transaction manager and a clean-up manager.
18. The non-transitory computer-readable medium of claim 17, the operations further comprising attaching the clean-up entry to a next subsequent transaction in response to determining that the time is not less than the most-recent minimum read timestamp.
19. The non-transitory computer-readable medium of claim 17, wherein the most-recent minimum read timestamp is a lowest read timestamp of all executing transactions in the database system.
20. The non-transitory computer-readable medium of claim 17, wherein the time is equal to a commit timestamp of a last-committed parallel transaction.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
June 27, 2023
August 13, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.