Predicate Locking

Predicate Locking is a concurrency control mechanism that belongs to the class of locking protocols, differing from conventional key-based locking by allowing transactions to lock sets of data items satisfying a specified predicate, thereby preventing phantom reads and ensuring serializability in relational database systems.

11

Publications

2.6K

Citations

21

Authors

7

Institutions

Publications per year

2017–2026

0

Authors

21

  1. MS
    Michael Stonebraker

    University of California, Berkeley, United States

    2 publications · 164 citations

    2

    h-index

  2. HB
    Harry B. Hunt

    University at Albany, State University of New York, United States

    2 publications · 145 citations

    2

    h-index

  3. SM
    Sharad Mehrotra

    University of California, Irvine, United States

    2 publications · 63 citations

    2

    h-index

  4. KC
    Kaushik Chakrabarti

    Microsoft (United States), United States

    2 publications · 63 citations

    2

    h-index

  5. DJ
    Daniel J. Rosenkrantz

    University at Albany, State University of New York, United States

    2 publications · 145 citations

    2

    h-index

1–5 of 21

Venues

  1. ACM SIGMOD Record

    1 publications · 36 citations

    1

    h-index

  2. Very Large Data Bases

    Conference · 1 publications · 119 citations

    1

    h-index

  3. ACM Transactions on Database Systems

    TODS · 1 publications · 108 citations

    1

    h-index

  4. Communications of the ACM

    1 publications · 2K citations

    1

    h-index

  5. IFIP Congress

    Conference · 1 publications · 26 citations

    1

    h-index

1–5