[1991] Proceedings. Seventh International Conference on Data Engineering
DOI: 10.1109/icde.1991.131477
|View full text |Cite
|
Sign up to set email alerts
|

Atomic commitment for integrated database systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 32 publications
(11 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…Another dimension is that certain types of databases more typically afford guarantees that others do not; for example, many relational databases offer grades of ACID (Atomicity, Consistency, Isolation and Durability) guarantees [42], while few document-oriented or RDF triple stores do, partly due to technicalities arising from realising these guarantees in these settings. An additional advantage to relational databases is that extensive research on them has yielded well-known methods to "tune" performance, such as ways to factor tables to avoid otherwise computationally expensive query operations, the creation of indexes and so on, whereas such methods and query performance predictability is remains less well established for other database types.…”
Section: The Data Storementioning
confidence: 99%
“…Another dimension is that certain types of databases more typically afford guarantees that others do not; for example, many relational databases offer grades of ACID (Atomicity, Consistency, Isolation and Durability) guarantees [42], while few document-oriented or RDF triple stores do, partly due to technicalities arising from realising these guarantees in these settings. An additional advantage to relational databases is that extensive research on them has yielded well-known methods to "tune" performance, such as ways to factor tables to avoid otherwise computationally expensive query operations, the creation of indexes and so on, whereas such methods and query performance predictability is remains less well established for other database types.…”
Section: The Data Storementioning
confidence: 99%
“…Theoretical and practical issues of multi-level transaction management have been addressed (Weikum and Schek, 1984, 1991Shasha, 1985;Moss et al, 1986;Weikum, 1986Weikum, , 1987Weikum, , 1991Martin, 1987;Garcia-Molina and Salem, 1987;Beeriet al, 1988Beeriet al, , 1989yon Bueltzingsloewen et al, 1988;Fekete et al, 1988;Hadzilacos and Hadzilacos, 1988;Shasha and Goodman, 1988;Broessler and Freisleben, 1989;Badrinath and Ramamritham, 1990;Cart and Ferric, 1990;Rakow et al, 1990;Weikum et al, 1990;Muth and Rakow, 1991;Shrivastava et al, 1991;Muth et al, 1993.) However, to our knowledge, none of the previous work has presented a full implementation.…”
Section: Introductionmentioning
confidence: 98%
“…A number of FDBS transaction management algorithms have been proposed for a failure-free environment [21,9,16,3,13,18]. Recently, researchers have addressed the issue of transaction management in a failure-prone environment and a number of proposal have been made [4,25,1,12,24,20,7,26]. Each proposed recovery algorithm imposes some restrictions, which affect different aspects of local autonomy.…”
Section: Introductionmentioning
confidence: 99%
“…• giving up control autonomy, i.e., no local transactions can be executed without involving the FDBS [24,20].…”
Section: Introductionmentioning
confidence: 99%