On serializability
From MaRDI portal
Recommendations
Cites work
- Algorithmic aspects of multiversion concurrency control
- Multi-version concurrency control scheme for a database system
- Multiversion concurrency control—theory and algorithms
- On Concurrency Control by Multiple Versions
- Serializability by Locking
- The Complexity of Reliable Concurrency Control
- The notions of consistency and predicate locks in a database system
- The serializability of concurrent database updates
Cited in
(41)- Maximal serializability of iterated transactions
- Generalized theory of serializability
- Serializability theory for replicated databases
- Concurrent execution of transaction copies
- The complexity of strict serializability revisited
- Serialization of concurrent programs
- Some constraints assuring serializability in multidatabases
- Integrity aspects of quasi serializability
- Conceptual level concurrency control of relational update transactions
- Critique of the Lake Arrowhead three
- On correctness on nonserializable executions
- Eventually-serializable data services
- On the serializability theorem for nested transactions
- Relative serializability: An approach for relaxing the atomicity of transactions
- Universally serializable computation
- Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access)
- Correctness criteria for databases using abstract data types
- I-serializability: generalized correctness for transaction-based environments
- Consistency and Serializability in Concurrent Database Systems
- Multilevel atomicity—a new correctness criterion for database concurrency control
- The serializability problem for a temporal logic of transaction queries
- An algorithm for checking the serialization of execution of set of transactions
- scientific article; zbMATH DE number 3919823 (Why is no real title available?)
- scientific article; zbMATH DE number 3947612 (Why is no real title available?)
- scientific article; zbMATH DE number 3965471 (Why is no real title available?)
- scientific article; zbMATH DE number 4049032 (Why is no real title available?)
- scientific article; zbMATH DE number 4060693 (Why is no real title available?)
- scientific article; zbMATH DE number 4094784 (Why is no real title available?)
- Precise serialization for optimistic concurrency control
- scientific article; zbMATH DE number 1951113 (Why is no real title available?)
- scientific article; zbMATH DE number 1760043 (Why is no real title available?)
- Serializable histories in quantified propositional temporal logic
- SNAPSHOT Isolation: Why Do Some People Call it SERIALIZABLE?
- Sequential verification of serializability
- scientific article; zbMATH DE number 227421 (Why is no real title available?)
- Reducing conflict graph of multi-step transactions accessing ordered data with gaps
- scientific article; zbMATH DE number 4182805 (Why is no real title available?)
- Serializable graphs
- Multiserialization of iterated transactions
- Distributed management of transactions in heterogeneous distributed database systems
- Parallel update transactions
This page was built for publication: On serializability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738609)