Paper Info
Title
Performance Analysis of Time-Stamp Ordering Algorithms in Database Systems: The Pure Restarts Case
Abstract
Due to the complexity of the issues affecting the performance of concurrency control algorithms in database systems most studies adopt different approaches and make different assumptions. We propose the use of a unified mean value analytic approach to the performance analysis of concurrency control algorithms. In this paper, we apply this modeling approach to analyze the performance of time-stamp ordering algorithms. We then compare our results with those reported on two-phase locking and optimistic algorithms, and generate several conclusions and recommendations. u003e
Year
DOI
Venue
1993
10.1109/ICCI.1993.315329
ICCI
Keywords
Field
DocType
pure restarts case,time-stamp ordering algorithms,database systems,performance analysis,complexity,boundary conditions,algorithm design and analysis,hardware,concurrency control,database system,database management systems,computer aided software engineering,throughput,computer science
Isolation (database systems),Serializability,Concurrency control,Computer science,Algorithm,Multiversion concurrency control,Distributed concurrency control,Database theory,Non-lock concurrency control,Optimistic concurrency control,Database
Conference
ISBN
Citations 
PageRank 
0-8186-4212-2
1
0.44
References 
Authors
3
7
Name
Order
Citations
PageRank
Mohamed Eltoweissy177761.78
Hussein M. Abdel-Wahab29720.10
Abougabal, M.330.86
Nagwa M. El-Makky46311.48
Souheir A. Fouad5131.45
Abdel-Wahab, H.6407.24
El-Makky, N.710.44