• DocumentCode
    2877939
  • Title

    Comparison of immediate-update and workspace transactions: serializability and failure tolerance

  • Author

    Turc, Stéphane

  • Author_Institution
    Centre de Recherche en Inf., Montpellier II Univ., France
  • fYear
    1990
  • fDate
    7-9 Mar 1990
  • Firstpage
    331
  • Lastpage
    340
  • Abstract
    A theoretical study of concurrency control and failure tolerance which includes both immediate-update (IU) and workspace (WS) transactions is presented. All previous formal approaches only consider IU transactions. A WS transaction first reads objects and updates them only in its private workspace; the objects are written only after the WS transaction commits. In order to examine execution correctness for both transaction models, it is necessary to reshape serializability theory. The framework constructed here handles both transaction and system failures and covers IU and WS transactions. The results show that the two transaction types impose different conditions on schedulers and recovery algorithms and deny the fact that WS transactions require optimistic schedulers and `intention list´ recovery. In comparing the two models, some histories of WS transactions which could not be obtained with IU transactions are given
  • Keywords
    concurrency control; transaction processing; concurrency control; failure tolerance; immediate-update; recovery algorithms; schedulers; serializability; workspace transactions; Computer crashes; Concurrency control; History; Scheduling algorithm; Shadow mapping;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
  • Conference_Location
    Miami Beach, FL
  • Print_ISBN
    0-8186-2035-8
  • Type

    conf

  • DOI
    10.1109/PARBSE.1990.77158
  • Filename
    77158