Schedule (computer science)
In the fields of databases and transaction processing (transaction management), a schedule (or history) of a system is an abstract model to describe execution of transactions running in the system. Often it is a list of operations (actions) ordered by time, performed by a set of transactions that are executed together in the system. If the order in time between certain operations is not determined by the system, then a partial order is used. Examples of such operations are requesting a read operation, reading, writing, aborting, committing, requesting a 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 reason about and describe certain phenomena. Sch
Wikipage disambiguates
Avoiding cascading abortsAvoids cascading abortsBlind writeCommitment orderingConcurrency controlDatabase scheduleDistributed concurrency controlGlobal serializabilityGlossary of computer scienceHistory (database systems)History (disambiguation)Interrupt handlerIsolation (database systems)Precedence graphRecoverableRecoverable executionRecoverable historyScheduleSchedule (database systems)Schedule (disambiguation)SerializabilityStrict (disambiguation)Two-phase lockingWrite–write conflict
Link from a Wikipage to another Wikipage
primaryTopic
Schedule (computer science)
In the fields of databases and transaction processing (transaction management), a schedule (or history) of a system is an abstract model to describe execution of transactions running in the system. Often it is a list of operations (actions) ordered by time, performed by a set of transactions that are executed together in the system. If the order in time between certain operations is not determined by the system, then a partial order is used. Examples of such operations are requesting a read operation, reading, writing, aborting, committing, requesting a 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 reason about and describe certain phenomena. Sch
has abstract
Als Historie (der einem vollst ...... el ausgeführten Transaktionen.
@de
In the fields of databases and ...... se concurrency control theory.
@en
La théorie de l'ordonnancement ...... onnelle des tâches planifiées.
@fr
Στους τομείς των Βάσεων Δεδομέ ...... εγχο ταυτοχρονισμού σε μια ΒΔ.
@el
Расписанием называется упорядо ...... ной или нескольких транзакции.
@ru
データベースやトランザクション処理(トランザクション管理)の ...... システムから見た場合のトランザクションの動作を説明している。
@ja
排程或譯排班,是將任務分配至資源的過程,在計算機或生產處理中 ...... 源,若將登機口使用數量及時間壓到最低,亦即能節省最多的成本。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,018,871,348
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Als Historie (der einem vollst ...... el ausgeführten Transaktionen.
@de
In the fields of databases and ...... escribe certain phenomena. Sch
@en
La théorie de l'ordonnancement ...... onnelle des tâches planifiées.
@fr
Στους τομείς των Βάσεων Δεδομέ ...... για τον έλεγχο ταυτοχρονισμού
@el
Расписанием называется упорядо ...... ной или нескольких транзакции.
@ru
データベースやトランザクション処理(トランザクション管理)の ...... システムから見た場合のトランザクションの動作を説明している。
@ja
排程或譯排班,是將任務分配至資源的過程,在計算機或生產處理中 ...... 源,若將登機口使用數量及時間壓到最低,亦即能節省最多的成本。
@zh
label
Historie (Transaktionsverarbeitung)
@de
Schedule (computer science)
@en
Théorie de l'ordonnancement
@fr
Χρονοπρόγραμμα
@el
Расписание (СУБД)
@ru
スケジュール (コンピュータ科学)
@ja
排程
@zh
스케줄 (컴퓨터 과학)
@ko