Serializability of concurrent database updates
A sequence of interleaved user transactions in a database system may not be serializable, i.e., equivalent to some sequential execution of the individual transactions. Using a simple transaction model we show that recognizing the transaction histories which are serializable is an NP-complete problem...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1979
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021875875 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880222s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227432319 | ||
| 035 | |a (DE-599)BVBBV021875875 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-210 | ||
| 100 | 1 | |a Papadimitriou, Christos H. |d 1949- |e Verfasser |0 (DE-588)135731909 |4 aut | |
| 245 | 1 | 0 | |a Serializability of concurrent database updates |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1979 | |
| 300 | |a 54 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a A sequence of interleaved user transactions in a database system may not be serializable, i.e., equivalent to some sequential execution of the individual transactions. Using a simple transaction model we show that recognizing the transaction histories which are serializable is an NP-complete problem. We therefore introduce several efficiently recognizable subclasses of the class of serializable histories; most of these subclasses correspond to serializability principles existing in the literature and used in practice. We also propose two new principles which subsume all previously known ones. We give necessary and sufficient conditions for a class of histories to be the output of an efficient history scheduler; these conditions imply that there can be no efficient scheduler that outputs all of serializable histories, and also that all subclasses of serializable histories studied above have an efficient scheduler. Finally, we show how our results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems. (Author). | |
| 650 | 7 | |a Data bases |2 dtict | |
| 650 | 7 | |a Data management |2 dtict | |
| 650 | 7 | |a Formats |2 dtict | |
| 650 | 7 | |a Heuristic methods |2 dtict | |
| 650 | 7 | |a Information Science |2 scgdst | |
| 650 | 7 | |a Information transfer |2 dtict | |
| 650 | 7 | |a Input output processing |2 dtict | |
| 650 | 7 | |a Network flows |2 dtict | |
| 650 | 7 | |a Sequential analysis |2 dtict | |
| 650 | 7 | |a Set theory |2 dtict | |
| 650 | 0 | 7 | |a Datenbanksystem |0 (DE-588)4113276-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Datenbanksystem |0 (DE-588)4113276-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091519 | ||
Datensatz im Suchindex
| _version_ | 1804135815242055680 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Papadimitriou, Christos H. 1949- |
| author_GND | (DE-588)135731909 |
| author_facet | Papadimitriou, Christos H. 1949- |
| author_role | aut |
| author_sort | Papadimitriou, Christos H. 1949- |
| author_variant | c h p ch chp |
| building | Verbundindex |
| bvnumber | BV021875875 |
| ctrlnum | (OCoLC)227432319 (DE-599)BVBBV021875875 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02552nam a2200457zc 4500</leader><controlfield tag="001">BV021875875</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880222s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227432319</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021875875</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-210</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Papadimitriou, Christos H.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135731909</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Serializability of concurrent database updates</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">54 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="520" ind1="3" ind2=" "><subfield code="a">A sequence of interleaved user transactions in a database system may not be serializable, i.e., equivalent to some sequential execution of the individual transactions. Using a simple transaction model we show that recognizing the transaction histories which are serializable is an NP-complete problem. We therefore introduce several efficiently recognizable subclasses of the class of serializable histories; most of these subclasses correspond to serializability principles existing in the literature and used in practice. We also propose two new principles which subsume all previously known ones. We give necessary and sufficient conditions for a class of histories to be the output of an efficient history scheduler; these conditions imply that there can be no efficient scheduler that outputs all of serializable histories, and also that all subclasses of serializable histories studied above have an efficient scheduler. Finally, we show how our results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data bases</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data management</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formats</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Heuristic methods</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information Science</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information transfer</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Input output processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Network flows</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sequential analysis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Set theory</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenbanksystem</subfield><subfield code="0">(DE-588)4113276-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenbanksystem</subfield><subfield code="0">(DE-588)4113276-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091519</subfield></datafield></record></collection> |
| id | DE-604.BV021875875 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:35Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091519 |
| oclc_num | 227432319 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 54 S. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Papadimitriou, Christos H. 1949- Verfasser (DE-588)135731909 aut Serializability of concurrent database updates Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1979 54 S. txt rdacontent n rdamedia nc rdacarrier A sequence of interleaved user transactions in a database system may not be serializable, i.e., equivalent to some sequential execution of the individual transactions. Using a simple transaction model we show that recognizing the transaction histories which are serializable is an NP-complete problem. We therefore introduce several efficiently recognizable subclasses of the class of serializable histories; most of these subclasses correspond to serializability principles existing in the literature and used in practice. We also propose two new principles which subsume all previously known ones. We give necessary and sufficient conditions for a class of histories to be the output of an efficient history scheduler; these conditions imply that there can be no efficient scheduler that outputs all of serializable histories, and also that all subclasses of serializable histories studied above have an efficient scheduler. Finally, we show how our results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems. (Author). Data bases dtict Data management dtict Formats dtict Heuristic methods dtict Information Science scgdst Information transfer dtict Input output processing dtict Network flows dtict Sequential analysis dtict Set theory dtict Datenbanksystem (DE-588)4113276-2 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf Datenbanksystem (DE-588)4113276-2 s DE-604 Scheduling (DE-588)4179449-7 s |
| spellingShingle | Papadimitriou, Christos H. 1949- Serializability of concurrent database updates Data bases dtict Data management dtict Formats dtict Heuristic methods dtict Information Science scgdst Information transfer dtict Input output processing dtict Network flows dtict Sequential analysis dtict Set theory dtict Datenbanksystem (DE-588)4113276-2 gnd Scheduling (DE-588)4179449-7 gnd |
| subject_GND | (DE-588)4113276-2 (DE-588)4179449-7 |
| title | Serializability of concurrent database updates |
| title_auth | Serializability of concurrent database updates |
| title_exact_search | Serializability of concurrent database updates |
| title_exact_search_txtP | Serializability of concurrent database updates |
| title_full | Serializability of concurrent database updates |
| title_fullStr | Serializability of concurrent database updates |
| title_full_unstemmed | Serializability of concurrent database updates |
| title_short | Serializability of concurrent database updates |
| title_sort | serializability of concurrent database updates |
| topic | Data bases dtict Data management dtict Formats dtict Heuristic methods dtict Information Science scgdst Information transfer dtict Input output processing dtict Network flows dtict Sequential analysis dtict Set theory dtict Datenbanksystem (DE-588)4113276-2 gnd Scheduling (DE-588)4179449-7 gnd |
| topic_facet | Data bases Data management Formats Heuristic methods Information Science Information transfer Input output processing Network flows Sequential analysis Set theory Datenbanksystem Scheduling |
| work_keys_str_mv | AT papadimitriouchristosh serializabilityofconcurrentdatabaseupdates |