The dual-level validation concurrency control method:
Abstract: "Atomic data types permit maximum concurrency among transactions by exploiting the semantics of object operations. Concurrency control is needed to ensure both object level atomicity and transaction level atomicity. It must be possible to regard each operation on an object as elementa...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
1993
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
301 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Atomic data types permit maximum concurrency among transactions by exploiting the semantics of object operations. Concurrency control is needed to ensure both object level atomicity and transaction level atomicity. It must be possible to regard each operation on an object as elementary. Recovery methods for transactions which are based on atomic objects must take into account that partial results of a transaction might be seen by other transactions. This paper presents, formalises and verifies a protocol called the dual-level validation method which can be used to provide atomicity for atomic data types. It is optimistic and has a number of advantages over previous methods It permits maximum concurrency at the low level by allowing non- conflicting operations to be scheduled concurrently. It allows applications to cope with very large objects by supporting multi- granularity shadowing. Transaction recovery is simple to implement. The method performs well, particularly when different transactions are unlikely to access the same (sub)objects concurrently. Finally, it is well suited to a distributed environment since validation and commit are not implemented atomically. |
| Beschreibung: | 24 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010412685 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951009s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)29515669 | ||
| 035 | |a (DE-599)BVBBV010412685 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Wu, Zhixue |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The dual-level validation concurrency control method |c by Zhixue Wu, Ken Moody and Jean Bacon |
| 264 | 1 | |a Cambridge |c 1993 | |
| 300 | |a 24 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 301 | |
| 520 | 3 | |a Abstract: "Atomic data types permit maximum concurrency among transactions by exploiting the semantics of object operations. Concurrency control is needed to ensure both object level atomicity and transaction level atomicity. It must be possible to regard each operation on an object as elementary. Recovery methods for transactions which are based on atomic objects must take into account that partial results of a transaction might be seen by other transactions. This paper presents, formalises and verifies a protocol called the dual-level validation method which can be used to provide atomicity for atomic data types. It is optimistic and has a number of advantages over previous methods | |
| 520 | 3 | |a It permits maximum concurrency at the low level by allowing non- conflicting operations to be scheduled concurrently. It allows applications to cope with very large objects by supporting multi- granularity shadowing. Transaction recovery is simple to implement. The method performs well, particularly when different transactions are unlikely to access the same (sub)objects concurrently. Finally, it is well suited to a distributed environment since validation and commit are not implemented atomically. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 700 | 1 | |a Moody, Ken |e Verfasser |4 aut | |
| 700 | 1 | |a Bacon, Jean |e Verfasser |4 aut | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 301 |w (DE-604)BV004055605 |9 301 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006934488 | ||
Datensatz im Suchindex
| _version_ | 1804124841356296192 |
|---|---|
| any_adam_object | |
| author | Wu, Zhixue Moody, Ken Bacon, Jean |
| author_facet | Wu, Zhixue Moody, Ken Bacon, Jean |
| author_role | aut aut aut |
| author_sort | Wu, Zhixue |
| author_variant | z w zw k m km j b jb |
| building | Verbundindex |
| bvnumber | BV010412685 |
| ctrlnum | (OCoLC)29515669 (DE-599)BVBBV010412685 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02226nam a2200325 cb4500</leader><controlfield tag="001">BV010412685</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951009s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29515669</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010412685</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wu, Zhixue</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The dual-level validation concurrency control method</subfield><subfield code="c">by Zhixue Wu, Ken Moody and Jean Bacon</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">301</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Atomic data types permit maximum concurrency among transactions by exploiting the semantics of object operations. Concurrency control is needed to ensure both object level atomicity and transaction level atomicity. It must be possible to regard each operation on an object as elementary. Recovery methods for transactions which are based on atomic objects must take into account that partial results of a transaction might be seen by other transactions. This paper presents, formalises and verifies a protocol called the dual-level validation method which can be used to provide atomicity for atomic data types. It is optimistic and has a number of advantages over previous methods</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">It permits maximum concurrency at the low level by allowing non- conflicting operations to be scheduled concurrently. It allows applications to cope with very large objects by supporting multi- granularity shadowing. Transaction recovery is simple to implement. The method performs well, particularly when different transactions are unlikely to access the same (sub)objects concurrently. Finally, it is well suited to a distributed environment since validation and commit are not implemented atomically.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moody, Ken</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bacon, Jean</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">301</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">301</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006934488</subfield></datafield></record></collection> |
| id | DE-604.BV010412685 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006934488 |
| oclc_num | 29515669 |
| open_access_boolean | |
| physical | 24 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Wu, Zhixue Verfasser aut The dual-level validation concurrency control method by Zhixue Wu, Ken Moody and Jean Bacon Cambridge 1993 24 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 301 Abstract: "Atomic data types permit maximum concurrency among transactions by exploiting the semantics of object operations. Concurrency control is needed to ensure both object level atomicity and transaction level atomicity. It must be possible to regard each operation on an object as elementary. Recovery methods for transactions which are based on atomic objects must take into account that partial results of a transaction might be seen by other transactions. This paper presents, formalises and verifies a protocol called the dual-level validation method which can be used to provide atomicity for atomic data types. It is optimistic and has a number of advantages over previous methods It permits maximum concurrency at the low level by allowing non- conflicting operations to be scheduled concurrently. It allows applications to cope with very large objects by supporting multi- granularity shadowing. Transaction recovery is simple to implement. The method performs well, particularly when different transactions are unlikely to access the same (sub)objects concurrently. Finally, it is well suited to a distributed environment since validation and commit are not implemented atomically. Computer software sigle Abstract data types (Computer science) Moody, Ken Verfasser aut Bacon, Jean Verfasser aut Computer Laboratory <Cambridge>: Technical report 301 (DE-604)BV004055605 301 |
| spellingShingle | Wu, Zhixue Moody, Ken Bacon, Jean The dual-level validation concurrency control method Computer Laboratory <Cambridge>: Technical report Computer software sigle Abstract data types (Computer science) |
| title | The dual-level validation concurrency control method |
| title_auth | The dual-level validation concurrency control method |
| title_exact_search | The dual-level validation concurrency control method |
| title_full | The dual-level validation concurrency control method by Zhixue Wu, Ken Moody and Jean Bacon |
| title_fullStr | The dual-level validation concurrency control method by Zhixue Wu, Ken Moody and Jean Bacon |
| title_full_unstemmed | The dual-level validation concurrency control method by Zhixue Wu, Ken Moody and Jean Bacon |
| title_short | The dual-level validation concurrency control method |
| title_sort | the dual level validation concurrency control method |
| topic | Computer software sigle Abstract data types (Computer science) |
| topic_facet | Computer software Abstract data types (Computer science) |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT wuzhixue theduallevelvalidationconcurrencycontrolmethod AT moodyken theduallevelvalidationconcurrencycontrolmethod AT baconjean theduallevelvalidationconcurrencycontrolmethod |