We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

Serializability of Concurrent Data Base Updates

Thumbnail Image
Download
Name

MIT-LCS-TR-210.pdf

Size

1.87 MB

Format

Adobe PDF

Checksum (MD5)

0ad12b82172a0634ee109d1142003d7d

Author(s)
Papadimitriou, Christos H.
Date Issued
March 1979
Series/Report no.
MIT-LCS-TR-210
Abstract
A sequence of interleaved user transactions in a data base system may not be serializable, i.e., equivalent to some sequential execution of the individual transactions. Using a simple transaction model we show that recognizing the transaction histories which are serializable is an NP-complete problem.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.