I-serializability: generalized correctness for transaction-based environments

DOI10.1016/S0020-0190(97)00124-5MaRDI QIDQ287187zbMATH OpenOpenAlexFDO

Authors Jürgen Ebert, Gottfried Vossen

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00124-5

zbMATH Keywords

databasesdatabase transactionsI-serializabilityserializability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Database theory (68P15)

Recommendations

• On serializability
• Generalized theory of serializability
• On correctness on nonserializable executions
• scientific article; zbMATH DE number 227421
• Serialization of concurrent programs

Cites work

• A theory of reliability in database systems
• Computer science today. Recent trends and developments
• The notions of consistency and predicate locks in a database system
• The serializability of concurrent database updates

Cited in

(5)

• Serializability for eventual consistency: criterion, analysis, and applications
• Using eternity variables to specify and prove a serializable database interface
• scientific article; zbMATH DE number 3896285 (Why is no real title available?)
• Semantic serializability: A correctness criterion for processing transactions in advanced database applications
• On relaxing serializability by constraining transaction readsets

This page was built for publication: I-serializability: generalized correctness for transaction-based environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287187)