Abstract | ||
---|---|---|
The diversity of available concurrency control algorithms in database systems necessitates the development of quantitative methods for evaluating their performance. This paper proposes an analytical model to analyze the performance of Time-stamp Ordering algorithms. In particular, Time-stamp Ordering employing blocking and restarts, both with and without Thomas Write Rule. The modeling approach is promising since it has the potential of providing useful insights to DBMS designers and at the same time very inexpensive to use. Moreover, the results obtained are extensive and closely track those of simulation. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1007/3-540-54029-6_176 | ICCI |
Keywords | DocType | ISBN |
performance evaluation,mean value approach,time-stamp ordering algorithms,database system,concurrency control,quantitative method | Conference | 3-540-54029-6 |
Citations | PageRank | References |
2 | 0.42 | 6 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mohamed Eltoweissy | 1 | 777 | 61.78 |
Nagwa M. El-Makky | 2 | 63 | 11.48 |
Abougabal, M. | 3 | 3 | 0.86 |
Souheir A. Fouad | 4 | 13 | 1.45 |