Systems and methods for implementing a multi-host record lock deadlock feedback mechanism
US-2017308564-A1 · Oct 26, 2017 · US
US8990177B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8990177-B2 |
| Application number | US-201113283543-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 27, 2011 |
| Priority date | Oct 27, 2011 |
| Publication date | Mar 24, 2015 |
| Grant date | Mar 24, 2015 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.
Opening claim text (preview).
What is claimed is: 1. A method comprising: maintaining a set of recent commit database rows, each comprising a commit timestamp of a committed transaction, a row identifier that identifies a row in a persistent database table, and a version identifier for the row affected by the committed transaction; receiving a first request for a starting timestamp to read a set of rows; in response to receiving the first request, generating a started timestamp; receiving a second reques…
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Answers are generated from the same data shown on this page.