How to execute ULTRA transactions:
Abstract: "In [WF97, WFF98a, WFF98b] we describe the language ULTRA that has been designed for the specification of database updates in a modular, rule-based fashion. We provide a model-theoretic semantics based on deferred updates, which means that update requests are determined and collected...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1998
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1998,12 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In [WF97, WFF98a, WFF98b] we describe the language ULTRA that has been designed for the specification of database updates in a modular, rule-based fashion. We provide a model-theoretic semantics based on deferred updates, which means that update requests are determined and collected in an evaluation phase without changing the database state and the corresponding updates are performed in a subsequent materialization phase. As shown in [WFF98a, WFF98b], the semantics can be implemented using an optimistic transaction processing method. From a practical point of view, however, a straightforward implementation of the logical semantics is not satisfactory. In this paper we describe some of the arising problems and outline a flexible system architecture, which can serve as a framework for the implementation. Basic updates are performed (and even committed) on an underlying database system simultaneously with the logical evaluation of the ULTRA transactions. Recovery is done by issuing compensating operations in case of failure. Although the architecture appears to be rather different from the logical concepts at a first glance, we actually stay close to the logical semantics and can exploit a significant amount of the evaluation flexibility provided by the LOLA system [ZF97]. In particular, we are not tied to a pure top-down evaluation with backtracking." |
| Beschreibung: | 23 S. graph Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012223065 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 981026s1998 |||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)41138359 | ||
| 035 | |a (DE-599)BVBBV012223065 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-634 | ||
| 084 | |a SS 5600 |0 (DE-625)143571: |2 rvk | ||
| 100 | 1 | |a Wichert, Carl-Alexander |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a How to execute ULTRA transactions |c Carl-Alexander Wichert ; Alfred Fent ; Burkhard Freitag |
| 264 | 1 | |a Passau |c 1998 | |
| 300 | |a 23 S. |b graph Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1998,12 | |
| 520 | 3 | |a Abstract: "In [WF97, WFF98a, WFF98b] we describe the language ULTRA that has been designed for the specification of database updates in a modular, rule-based fashion. We provide a model-theoretic semantics based on deferred updates, which means that update requests are determined and collected in an evaluation phase without changing the database state and the corresponding updates are performed in a subsequent materialization phase. As shown in [WFF98a, WFF98b], the semantics can be implemented using an optimistic transaction processing method. From a practical point of view, however, a straightforward implementation of the logical semantics is not satisfactory. In this paper we describe some of the arising problems and outline a flexible system architecture, which can serve as a framework for the implementation. Basic updates are performed (and even committed) on an underlying database system simultaneously with the logical evaluation of the ULTRA transactions. Recovery is done by issuing compensating operations in case of failure. Although the architecture appears to be rather different from the logical concepts at a first glance, we actually stay close to the logical semantics and can exploit a significant amount of the evaluation flexibility provided by the LOLA system [ZF97]. In particular, we are not tied to a pure top-down evaluation with backtracking." | |
| 650 | 4 | |a Computer architecture | |
| 650 | 4 | |a Database management | |
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 4 | |a Rule-based programming | |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Fent, Alfred |e Verfasser |4 aut | |
| 700 | 1 | |a Freitag, Burkhard |d 1953- |e Verfasser |0 (DE-588)120549158 |4 aut | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1998,12 |w (DE-604)BV000905393 |9 1998,12 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008281794 | ||
Datensatz im Suchindex
| _version_ | 1804126839124262912 |
|---|---|
| any_adam_object | |
| author | Wichert, Carl-Alexander Fent, Alfred Freitag, Burkhard 1953- |
| author_GND | (DE-588)120549158 |
| author_facet | Wichert, Carl-Alexander Fent, Alfred Freitag, Burkhard 1953- |
| author_role | aut aut aut |
| author_sort | Wichert, Carl-Alexander |
| author_variant | c a w caw a f af b f bf |
| building | Verbundindex |
| bvnumber | BV012223065 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)41138359 (DE-599)BVBBV012223065 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03048nam a2200445 cb4500</leader><controlfield tag="001">BV012223065</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">981026s1998 |||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)41138359</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012223065</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="049" ind1=" " ind2=" "><subfield code="a">DE-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5600</subfield><subfield code="0">(DE-625)143571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wichert, Carl-Alexander</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">How to execute ULTRA transactions</subfield><subfield code="c">Carl-Alexander Wichert ; Alfred Fent ; Burkhard Freitag</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 S.</subfield><subfield code="b">graph Darst.</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">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1998,12</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In [WF97, WFF98a, WFF98b] we describe the language ULTRA that has been designed for the specification of database updates in a modular, rule-based fashion. We provide a model-theoretic semantics based on deferred updates, which means that update requests are determined and collected in an evaluation phase without changing the database state and the corresponding updates are performed in a subsequent materialization phase. As shown in [WFF98a, WFF98b], the semantics can be implemented using an optimistic transaction processing method. From a practical point of view, however, a straightforward implementation of the logical semantics is not satisfactory. In this paper we describe some of the arising problems and outline a flexible system architecture, which can serve as a framework for the implementation. Basic updates are performed (and even committed) on an underlying database system simultaneously with the logical evaluation of the ULTRA transactions. Recovery is done by issuing compensating operations in case of failure. Although the architecture appears to be rather different from the logical concepts at a first glance, we actually stay close to the logical semantics and can exploit a significant amount of the evaluation flexibility provided by the LOLA system [ZF97]. In particular, we are not tied to a pure top-down evaluation with backtracking."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rule-based programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fent, Alfred</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Freitag, Burkhard</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120549158</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1998,12</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1998,12</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008281794</subfield></datafield></record></collection> |
| id | DE-604.BV012223065 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:23:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008281794 |
| oclc_num | 41138359 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-634 |
| physical | 23 S. graph Darst. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Wichert, Carl-Alexander Verfasser aut How to execute ULTRA transactions Carl-Alexander Wichert ; Alfred Fent ; Burkhard Freitag Passau 1998 23 S. graph Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1998,12 Abstract: "In [WF97, WFF98a, WFF98b] we describe the language ULTRA that has been designed for the specification of database updates in a modular, rule-based fashion. We provide a model-theoretic semantics based on deferred updates, which means that update requests are determined and collected in an evaluation phase without changing the database state and the corresponding updates are performed in a subsequent materialization phase. As shown in [WFF98a, WFF98b], the semantics can be implemented using an optimistic transaction processing method. From a practical point of view, however, a straightforward implementation of the logical semantics is not satisfactory. In this paper we describe some of the arising problems and outline a flexible system architecture, which can serve as a framework for the implementation. Basic updates are performed (and even committed) on an underlying database system simultaneously with the logical evaluation of the ULTRA transactions. Recovery is done by issuing compensating operations in case of failure. Although the architecture appears to be rather different from the logical concepts at a first glance, we actually stay close to the logical semantics and can exploit a significant amount of the evaluation flexibility provided by the LOLA system [ZF97]. In particular, we are not tied to a pure top-down evaluation with backtracking." Computer architecture Database management Programming languages (Electronic computers) Rule-based programming Informatik (DE-588)4026894-9 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Fent, Alfred Verfasser aut Freitag, Burkhard 1953- Verfasser (DE-588)120549158 aut Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1998,12 (DE-604)BV000905393 1998,12 |
| spellingShingle | Wichert, Carl-Alexander Fent, Alfred Freitag, Burkhard 1953- How to execute ULTRA transactions Computer architecture Database management Programming languages (Electronic computers) Rule-based programming Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4026894-9 (DE-588)4037944-9 (DE-588)4196735-5 |
| title | How to execute ULTRA transactions |
| title_auth | How to execute ULTRA transactions |
| title_exact_search | How to execute ULTRA transactions |
| title_full | How to execute ULTRA transactions Carl-Alexander Wichert ; Alfred Fent ; Burkhard Freitag |
| title_fullStr | How to execute ULTRA transactions Carl-Alexander Wichert ; Alfred Fent ; Burkhard Freitag |
| title_full_unstemmed | How to execute ULTRA transactions Carl-Alexander Wichert ; Alfred Fent ; Burkhard Freitag |
| title_short | How to execute ULTRA transactions |
| title_sort | how to execute ultra transactions |
| topic | Computer architecture Database management Programming languages (Electronic computers) Rule-based programming Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Computer architecture Database management Programming languages (Electronic computers) Rule-based programming Informatik Mathematik Theoretische Informatik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT wichertcarlalexander howtoexecuteultratransactions AT fentalfred howtoexecuteultratransactions AT freitagburkhard howtoexecuteultratransactions |