In concurrency control of databases, transaction processing (transaction management), and various transactional applications, both centralized and distributed, a transaction schedule is serializable if its outcome (e.g. , the resulting database state) is equal to the outcome of its transactions executed serially, i.e. , sequentially without overlapping in time. Transactions are normally executed concurrently (they overlap), since this is the most efficient way.