Pooling work across multiple transactions for reducing contention in operational analytics systems

US9772911B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9772911-B2
Application numberUS-201514671639-A
CountryUS
Kind codeB2
Filing dateMar 27, 2015
Priority dateMar 27, 2015
Publication dateSep 26, 2017
Grant dateSep 26, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method includes scanning multiple incoming database transaction requests. Each transaction includes one or more operations. Operations are clustered into a set of combined operations based on type of operation constraints. Log records are prepared and written for re-performing operations upon system failures, and for undoing operations upon an operation or a transaction failing to be processed fully. Each set of combined operations are performed within a thread. Each update operation is marked for a transaction within which the update operation belongs. Recoverable update operations belonging to a plurality of transactions are performed within a single logical thread of execution.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: scanning a plurality of incoming transaction requests for a database, wherein each transaction comprises at least one operation; clustering operations into at least one set of combined operations based on type of operation and database pages that the operations operate on; preparing and writing log records for re-performing operations upon system failures, and for undoing operations upon an operation failing to be processed fully; marking each update operation with an identifier of the transaction within which the update operation belongs; and performing each set of combined operations within a logical thread of execution. 2. The method of claim 1 , wherein multiple operations operate on a single database page under a consolidated latch. 3. The method of claim 2 , further comprising: for each database page that operations operate on, recording a value of a monotonically increasing counter; and incrementing the counter when the log records are written, wherein the counter value recorded on a particular database page indicates a subset of operations that have been operated on the particular database page. 4. The method of claim 1 , wherein transactions arise from separate nodes on a cluster of nodes. 5. The method of claim 4 , wherein the logical thread comprises an execution thread spread across multiple nodes or VM guests. 6. The method of claim 1 , wherein: an operation comprises at least one of an insert, a delete, or a data value modification; for an insert operation, operations are combined that are inserting rows of data into a same database table; and for a delete operation, operations are combined that are deleting data from a same database table. 7. The method of claim 1 , wherein database queries use the transaction identifier marked in the update operation for determining whether to ignore an operation effect or not. 8. The method of claim 1 , wherein the logical thread comprises an execution thread or process on at least one of a single node or virtual machine (VM). 9. The method of claim 1 , wherein operations are combined that are executing a common prepared statement. 10. A computer program product for pooling work across multiple transactions, the computer program product comprising a computer readable storage device having program code embodied therewith, the program code executable by a processor to: scan a plurality of incoming database transaction requests, wherein each transaction comprises at least one operation; cluster operations into a set of combined operations based on type of operation constraints and database pages the operations operate on; prepare and write log records for re-performing operations upon system failures, and for undoing operations upon an operation failing to be processed fully; perform each set of combined operations within a thread; mark each update operation for a transaction within which the update operation belongs; and perform recoverable update operations belonging to a plurality of transactions within a single logical thread of execution. 11. The computer program product of claim 10 , wherein multiple operations operate on a single database page under a consolidated latch. 12. The computer program product of claim 11 , further comprising: for each database page that operations operate on, recording a value of a monotonically increasing counter; and incrementing the counter when the log records are written, wherein the counter value recorded on a particular database page indicates a subset of operations that have been operated on the particular database page. 13. The computer program product of claim 10 , wherein transactions arise from separate nodes on a file system cluster. 14. The computer program product of claim 10 , wherein: an operation comprises at least one of an insert, a delete, or a data value modification; for an insert operation, operations are combined that are inserting rows of data into a same database table; for a delete operation, operations are combined that are deleting data from a same database table; and database queries use the marked update operation for a transaction for determining whether to ignore an operation effect or not. 15. The computer program product of claim 14 , wherein the logical thread comprises an execution thread or process on at least one of a single node or virtual machine (VM) and the logical thread comprises an execution thread spread across multiple nodes or VM guests. 16. A system comprising: a storage device configured to store one or more databases; a processor configured to: scan a plurality of incoming transaction requests for a database, wherein each transaction comprises at least one operation; cluster operations into a set of combined operations based on type of operation constraints and database pages that the operations operate on, and prepares and writes log records for re-performing operations upon system failures, and for undoing operations upon an operation failing to be processed fully; and marks each update operation for a transaction within which the update operation belongs; a batched requests processor that performs each set of combined operations within a thread; and a logger and roll-back processor that performs recoverable update operations belonging to a plurality of transactions within a logical thread of execution. 17. The system of claim 16 , wherein: multiple operations operate on a single database page under a consolidated latch; for each database page that operations operate on, the processor records a value of a monotonically increasing counter, and increments the counter when the log records are written; and the counter value recorded on a particular database page indicates a subset of operations that have been operated on the particular database page. 18. The system of claim 16 , wherein: transactions arise from separate nodes on a file system cluster; an operation comprises at least one of an insert, a delete, or a data value modification; for an insert operation, the cluster processor combines operations that are inserting rows of data into a same database table; and for a delete operation, the cluster processor combines operations that are deleting data from a same database table, wherein database queries use the marked update operation for a transaction for determining whether to ignore an operation effect or not. 19. The system of claim 18 , wherein the logical thread comprises an execution thread or process on at least one of a single node or virtual machine (VM). 20. The system of claim 18 , wherein the logical thread comprises an execution thread spread across multiple nodes or VM guests.

Assignees

Inventors

Classifications

  • Transaction processing · CPC title

  • Monitoring of transactions · CPC title

  • involving logging of persistent data for recovery · CPC title

  • Database-specific techniques · CPC title

  • Point-in-time backing up or restoration of persistent data · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9772911B2 cover?
A method includes scanning multiple incoming database transaction requests. Each transaction includes one or more operations. Operations are clustered into a set of combined operations based on type of operation constraints. Log records are prepared and written for re-performing operations upon system failures, and for undoing operations upon an operation or a transaction failing to be processe…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F11/1474. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Sep 26 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).