Halloween protection in a multi-version database system

US9116943B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9116943-B2
Application numberUS-201414272074-A
CountryUS
Kind codeB2
Filing dateMay 7, 2014
Priority dateOct 29, 2010
Publication dateAug 25, 2015
Grant dateAug 25, 2015

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.

Mitigating problems related to the Halloween problem including where update operations potentially allow the record to be visited more than once during the operation. A method includes accessing an instance of a data store operation statement. The instance of the data store operation statement is executed causing an update or delete to an old version of data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record and a deleted version of the data store record in the case of a delete in the data store. The instance of the data store operation statement is correlated with the new version of the data store record or the deleted version of the data store record.

First claim

Opening claim text (preview).

What is claimed is: 1. In a computing environment, a method of mitigating problems related to a Halloween problem including where update operations potentially allow a record to be visited more than once during an operation, the method comprising: accessing an instance of a data store operation statement; executing the instance of the data store operation statement causing an update or delete to an old version of a data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record or a deleted version of the data store record in the case of a delete in a data store; and correlating the instance of the data store operation statement with the new version of the data store record or the deleted version of the data store record, wherein correlating the instance of the data store operation statement with the new version of the data store record prevents the instance of the data store operation statement from reading the new version of the data store record so as to prevent the instance of a data store operation statement from accessing its own changes while not preventing the instance of the data store operation statement from accessing a state of the data store as it existed before the data store operation statement started executing. 2. The method of claim 1 , wherein said correlating the instance of the data store operation statement with the new version of the data store record or the deleted version of the data store record comprises storing the new version of the data store record or the deleted version of the data store record in a list associated with a current transaction that includes records created by the instance of the data store operation statement within the context of the current transaction. 3. The method of claim 2 , further comprising when performing a read operation, checking the list of records associated with the current transaction to determine if the record was created by the instance of the data store operation statement and should be unreadable or whether the record previously existed and should be readable. 4. The method of claim 2 , further comprising when performing a read operation, checking the list of records associated with the current transaction to determine if the record was deleted by the instance of the data store operation statement and should be readable or whether the record previously existed and should be unreadable. 5. The method of claim 1 , further comprising a same data store operation statement attempting to read the new version of the data store record and as a result of correlating the instance of the data store operation statement with the new version of the data store record, preventing the data store operation statement from reading the new version of the data store record. 6. The method of claim 1 , further comprising a same data store operation statement attempting to read the deleted version of the data store record and as a result of correlating the instance of the data store operation statement with the deleted version of the data store record, allowing the data store operation statement to read the deleted version of the data store record. 7. The method of claim 1 , further comprising a different data store operation statement attempting to read the new version of the data store record and as a result of correlating the instance of the data store operation statement with the new version of the data store record, allowing the different data store operation statement to read the new version of the data store record. 8. The method of claim 1 , further comprising a different data store operation statement attempting to read the deleted version of the data store record and as a result of correlating the instance of the data store operation statement with the deleted version of the data store record, preventing the different data store operation statement from reading the deleted version of the data store record. 9. In a computing environment, a computer readable storage device comprising computer executable instructions that when executed by one or more processors cause one or more processors to perform functions for mitigating problems related to a Halloween problem including where update operations potentially allow a record to be visited more than once during an operation, the functions comprising: accessing an instance of a data store operation statement; executing the instance of the data store operation statement causing an update or delete to an old version of a data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record or a deleted version of the data store record in the case of a delete in a data store; and correlating the instance of the data store operation statement with the new version of the data store record or the deleted version of the data store record, wherein correlating the instance of the data store operation statement with the new version of the data store record prevents the instance of the data store operation statement from reading the new version of the data store record so as to prevent the instance of a data store operation statement from accessing its own changes while not preventing the instance of the data store operation statement from accessing a state of the data store as it existed before the data store operation statement started executing. 10. The computer readable storage device of claim 9 , wherein said correlating the instance of the data store operation statement with the new version of the data store record or the deleted version of the data store record comprises storing the new version of the data store record or the deleted version of the data store record in a list associated with a current transaction that includes records created by the instance of the data store operation statement within the context of the current transaction. 11. The computer readable storage device of claim 10 , further comprising computer executable instructions that when executed by one or more processors cause when performing a read operation, checking the list of records associated with the current transaction to determine if the record was created by the instance of the data store operation statement and should be unreadable or whether the record previously existed and should be readable. 12. The computer readable storage device of claim 10 , further comprising computer executable instructions that when executed by one or more processors cause when performing a read operation, checking the list of records associated with the current transaction to determine if the record was deleted by the instance of the data store operation statement and should be readable or whether the record previously existed and should be unreadable. 13. The computer readable storage device of claim 9 , further comprising computer executable instructions that when executed by one or more processors cause the same data store operation statement to attempt to read the new version of the data store record and as a result of correlating the instance of the data store operation statement with the new version of the data store record, preventing the data store operation statement from reading the new version of the data store record. 14. The computer readable storage device of claim 9 , further comprising computer executable instructions that when executed by one or more processors cause the same data store operation statement to attempt to read the deleted version of the data store record and as a result of corre

Assignees

Inventors

Classifications

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 US9116943B2 cover?
Mitigating problems related to the Halloween problem including where update operations potentially allow the record to be visited more than once during the operation. A method includes accessing an instance of a data store operation statement. The instance of the data store operation statement is executed causing an update or delete to an old version of data store record or creation of a data s…
Who is the assignee on this patent?
Microsoft Corp, Microsoft Technology Licensing Llc
What technology area does this patent fall under?
Primary CPC classification G06F17/30371. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Aug 25 2015 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).