Blind write: Difference between revisions

From Wikipedia, the free encyclopedia

Content deleted Content added


Line 1: Line 1:

{{Short description|Computing term}}

{{Short description|Computing term}}

In [[computing]], a ”’blind write”’, also known as a ”’write-only transaction”’, occurs when a [[database transaction|transaction]] writes a value without reading it.<ref>{{Cite book |last1=Agrawal |first1=D. |last2=Krishnaswamy |first2=V. |chapter=Using multiversion data for non-interfering execution of write-only transactions |date=1991 |title=Proceedings of the 1991 ACM SIGMOD international conference on Management of data – SIGMOD ’91 |chapter-url=https://doi.org/10.1145/115790.115801 |location=New York, New York, USA |publisher=ACM Press |pages=98–107 |doi=10.1145/115790.115801|isbn=0-89791-425-2 }}</ref> In particular, a write w<sub>i</sub>(X) is said to be blind if it is not the last action of resource X and the following action on X is a write w<sub>j</sub>(X).{{Citation needed|date=June 2025}}

In [[computing]], a ”’blind write”’, also known as a ”’write-only transaction”’, occurs when a [[database transaction|transaction]] writes a value without reading it.<ref>{{Cite book |last1=Agrawal |first1=D. |last2=Krishnaswamy |first2=V. |chapter=Using multiversion data for non-interfering execution of write-only transactions |date=1991 |title=Proceedings of the 1991 ACM SIGMOD international conference on Management of data – SIGMOD ’91 |chapter-url=https://doi.org/10.1145/115790.115801 |location=New York, New York, USA |publisher=ACM Press |pages=98–107 |doi=10.1145/115790.115801|isbn=0-89791-425-2 }}</ref> In particular, a (X) not X X is write.{{Citation needed|date=June 2025}}

Blind writes can cause anomalies if multiple different blind write transactions are executed at the same time.<ref>{{Cite journal |last1=Herman |first1=Nanna Suryana |last2=Anshar |first2=Khairul |last3=Andono |first3=Pulung Nurtantio |date=2022-04-01 |title=Blind Write Protocol Throughput |journal=Journal of Physics: Conference Series |volume=2224 |issue=1 |article-number=012074 |doi=10.1088/1742-6596/2224/1/012074 |issn=1742-6588|doi-access=free |bibcode=2022JPhCS2224a2074H }}</ref>

Blind writes can cause anomalies if multiple different blind write transactions are executed at the same time.<ref>{{Cite journal |last1=Herman |first1=Nanna Suryana |last2=Anshar |first2=Khairul |last3=Andono |first3=Pulung Nurtantio |date=2022-04-01 |title=Blind Write Protocol Throughput |journal=Journal of Physics: Conference Series |volume=2224 |issue=1 |article-number=012074 |doi=10.1088/1742-6596/2224/1/012074 |issn=1742-6588|doi-access=free |bibcode=2022JPhCS2224a2074H }}</ref>


Revision as of 12:34, 19 November 2025

Computing term

In computing, a blind write, also known as a write-only transaction, occurs when a transaction writes a value without reading it.[1] In particular, if a read r(X) of a resource does not occur before a write w(X) to that resource, then w(X) is blind write.[citation needed]

Blind writes can cause anomalies if multiple different blind write transactions are executed at the same time.[2]

Any view serializable schedule that is not conflict serializable must contain a blind write.[3]

References

  1. ^ Agrawal, D.; Krishnaswamy, V. (1991). “Using multiversion data for non-interfering execution of write-only transactions”. Proceedings of the 1991 ACM SIGMOD international conference on Management of data – SIGMOD ’91. New York, New York, USA: ACM Press. pp. 98–107. doi:10.1145/115790.115801. ISBN 0-89791-425-2.
  2. ^ Herman, Nanna Suryana; Anshar, Khairul; Andono, Pulung Nurtantio (2022-04-01). “Blind Write Protocol Throughput”. Journal of Physics: Conference Series. 2224 (1) 012074. Bibcode:2022JPhCS2224a2074H. doi:10.1088/1742-6596/2224/1/012074. ISSN 1742-6588.
  3. ^ Silberschatz, Abraham; Korth, Henry; Sudarshan, S (2019-02-19). “Module 17: Transactions” (PDF). Database System Concepts (7th ed.). McGraw-Hill. ISBN 978-0-07-802215-9.

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top