Serializable Scheduling

Serializable Scheduling is a concurrency control protocol that belongs to the class of schedule correctness criteria, distinguished by its requirement that the interleaved execution of transactions must be equivalent to some serial order of those transactions, ensuring global consistency and isolation in a database system.

40

Publications

1.5K

Citations

72

Authors

46

Institutions

Publications per year

2017–2026

3

Authors

72

  1. TI
    Toshihide Ibaraki

    Kyoto University, Japan

    3 publications · 56 citations

    3

    h-index

  2. SH
    Sang H. Son

    University of Virginia, United States

    3 publications · 194 citations

    3

    h-index

  3. NK
    Naoki Katoh

    Kyoto University, Japan

    3 publications · 56 citations

    3

    h-index

  4. TE
    Tomoya Enokido

    Rissho University, Japan

    2 publications · 42 citations

    2

    h-index

  5. RR
    R. Rastogi

    Nokia (United States), United States

    2 publications · 78 citations

    2

    h-index

1–5 of 72

Venues

  1. ACM Transactions on Database Systems

    TODS · 3 publications · 179 citations

    3

    h-index

  2. IEEE Transactions on Software Engineering

    TSE · 3 publications · 35 citations

    3

    h-index

  3. Very Large Data Bases

    Conference · 1 publications · 154 citations

    1

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 1 publications · 35 citations

    1

    h-index

  5. Defense Technical Information Center (DTIC)

    Repository · 1 publications · 32 citations

    1

    h-index

1–5