Schedule (Computer Science) (Paperback)

High Quality Content by WIKIPEDIA articles! In the fields of databases and transaction processing (transaction management), a schedule (also called history) of a system is an abstract model to describe execution of transactions running in the system. Often it is a list of operations ordered by time, performed by a set of transactions that are executed together in the system. Examples of such actions are requesting a read operation, writing, aborting, committing, requesting lock, locking, etc. Not all transaction operation types should be included in a schedule, and typically only selected operation types (e.g., data access operations) are included, as needed to describe certain phenomena. Schedules and schedule properties are fundamental concepts in database concurrency control theory.