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
Parents
40
Formal model of correctness without serializabilty
H. K. Korth, Gregory D. Speegle · ACM SIGMOD Record · 1988 · 103 citations
1–5 of 40
72
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 72
46
The University of Texas at Austin
Austin, United States
4 h-index
11 publications
550 citations

Osaka University of Commerce
Higashiosaka, Japan
3 h-index
3 publications
56 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
5 publications
139 citations

Kobe University
Kobe, Japan
3 h-index
3 publications
56 citations
Simon Fraser University
Burnaby, Canada
3 h-index
3 publications
56 citations
University of Virginia
Charlottesville, United States
3 h-index
6 publications
414 citations
Technical University of Munich
Munich, Germany
2 h-index
3 publications
43 citations

Kyoto University
Kyoto, Japan
2 h-index
2 publications
25 citations
1–8 of 46
TODS · 3 publications · 179 citations
3
h-index
TSE · 3 publications · 35 citations
3
h-index
Conference · 1 publications · 154 citations
1
h-index
TKDE · 1 publications · 35 citations
1
h-index
Repository · 1 publications · 32 citations
1
h-index
1–5