Association for Computing Machinery
Most performance evaluation studies of database systems are high level studies limited by the expressiveness of their modeling formalisms. In this paper, the authors illustrate the potential of queuing petri nets as a successor of traditionally-adopted modeling formalisms in evaluating the complexities of database systems. This is demonstrated through the construction and analysis of a queuing petri net model of table-level database locking. They show that this model predicts mean response times better than a corresponding petri net model.