Maximal serializability of iterated transactions (Q1062471): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The notions of consistency and predicate locks in a database system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal serializability of iterated transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Program Schemata and Maximal Parallelism I. Fundamental Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168054 / rank
 
Normal rank

Latest revision as of 17:39, 14 June 2024

scientific article
In more languages
Configure
Language Label Description Also known as
English
Maximal serializability of iterated transactions
scientific article

    Statements

    Maximal serializability of iterated transactions (English)
    The serializability condition is usually considered in order to maintain the consistency of a Database in the presence of conflicting accesses to the Database performed by concurrent transactions. This serializability condition is considered herein as a general synchronization problem among transactions (or processes) which can be iterated infinitely often. The behaviour of such a system of transactions is represented by an infinite word over the alphabet of the operations performed by the transactions. Then a characterization of the prefixes of such behaviours satisfying the serializability condition - so-called correct behaviours - is given and it is shown that the set of all correct behaviours can be controlled by a finite automaton. As an example, the classical 'dining philosophers' problem is shown to be entirely modelled and solved as a serializability problem.
    database consistency
    conflicting accesses
    concurrent transactions
    synchronization
    infinite word
    finite automaton
    dining philosophers

    Identifiers