@article{(Open Science Index):https://publications.waset.org/pdf/3686,
	  title     = {A New Approach for Recoverable Timestamp Ordering Schedule},
	  author    = {Hassan M. Najadat},
	  country	= {},
	  institution	= {},
	  abstract     = {A new approach for timestamp ordering problem in
serializable schedules is presented. Since the number of users using
databases is increasing rapidly, the accuracy and needing high
throughput are main topics in database area. Strict 2PL does not
allow all possible serializable schedules and so does not result high
throughput. The main advantages of the approach are the ability to
enforce the execution of transaction to be recoverable and the high
achievable performance of concurrent execution in central databases.
Comparing to Strict 2PL, the general structure of the algorithm is
simple, free deadlock, and allows executing all possible serializable
schedules which results high throughput. Various examples which
include different orders of database operations are discussed.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {2},
	  number    = {1},
	  year      = {2008},
	  pages     = {213 - 217},
	  ee        = {https://publications.waset.org/pdf/3686},
	  url   	= {https://publications.waset.org/vol/13},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 13, 2008},
	}