Pessimistic Concurrency Control

Pessimistic Concurrency Control is a concurrency control method that belongs to the class of locking-based strategies, distinguished by its assumption that conflicts between transactions are likely to occur and thus requires transactions to acquire locks on data items prior to accessing them in order to prevent inconsistencies during distributed transaction execution.

87

Publications

5.8K

Citations

235

Authors

78

Institutions

Publications per year

2017–2026

3

Authors

235

  1. DD
    D.M. Dias

    IBM Research - Thomas J. Watson Research Center, United States

    4 publications · 191 citations

    4

    h-index

  2. BS
    Bratin Saha

    Intel (United States), United States

    3 publications · 632 citations

    3

    h-index

  3. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    3 publications · 181 citations

    3

    h-index

  4. AB
    Azer Bestavros

    Boston University, United States

    3 publications · 118 citations

    3

    h-index

  5. AA
    Ali-Reza Adl-Tabatabai

    Intel (United States), United States

    3 publications · 632 citations

    3

    h-index

1–5 of 235

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 6 publications · 711 citations

    6

    h-index

  2. Information Systems

    4 publications · 208 citations

    4

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 4 publications · 269 citations

    4

    h-index

  4. IEEE Data(base) Engineering Bulletin

    3 publications · 189 citations

    3

    h-index

  5. ACM SIGPLAN Notices

    2 publications · 30 citations

    2

    h-index

1–5