scientific article; zbMATH DE number 4182805

MaRDI QIDQ5748878zbMATH OpenFDO

Authors K. Vidyasankar

Publication date 1991

zbMATH Keywords

directed cutset matchinggraph contractionserializabilityserializable graphstransactions

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Generalized theory of serializability
• On serializability
• On the serializability theorem for nested transactions
• scientific article; zbMATH DE number 3965471
• A model for concurrency in nested transactions systems

Cited in

(12)

• Generalized theory of serializability
• Eventually-serializable data services
• On the serializability theorem for nested transactions
• Universally serializable computation
• Using eternity variables to specify and prove a serializable database interface
• scientific article; zbMATH DE number 3881904 (Why is no real title available?)
• The serializability problem for a temporal logic of transaction queries
• scientific article; zbMATH DE number 3965471 (Why is no real title available?)
• A model for concurrency in nested transactions systems
• Semantic serializability: A correctness criterion for processing transactions in advanced database applications
• Serializable histories in quantified propositional temporal logic
• Serializable graphs

This page was built for publication:

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