Basic timestamp ordering
Basic Timestamp Ordering (BTO) is an algorithm for synchronizing distributed systems .
The algorithm ensures that transactions that are generated in different components running in parallel do not "overtake" one another. It is not necessary to know the actual time for this; a logical clock (e.g. a Lamport clock ) is sufficient to generate unique time stamps that are assigned to the distributed transactions . The individual transaction processing components, called data managers , then check for each incoming transaction whether its time stamp is greater than that of all transactions processed up to that point. If this is not the case, i.e. a transaction has already been processed that was generated after the one now received, the transaction is rejected.
Web links
- Girish Saligram: Basic Timestamp Ordering Algorithm. Retrieved August 1, 2008 .
literature
- ↑ Erhard Rahm: Chapter 8.2 "Timestamp method" from book "Multi-computer database systems. Basics of distributed and parallel database processing" (1994) . uni-leipzig.de. Retrieved June 2, 2018.