ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Synchronization with eventcounts and sequencers
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Concurrent reading and writing
Communications of the ACM
Cryptography and data security
Cryptography and data security
Hierarchical database decomposition: a technique for database concurrency control
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Timestamp Ordering Algorithm for Secure, Single-Version, Multi-Level Databases
Results of the IFIP WG 11.3 Workshop on Database Security V: Status and Prospects
An efficient multiversion algorithm for secure servicing of transaction reads
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
The Partitioned Synchronization Rule for Planar Extendible Partial Orders
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
Timestamps are considered for distributed environments in which information flow is restricted to one direction through a planar lattice imposed on a network. For applications in such networks, existing timestamping algorithms require extension and modification. For example, in secure environments, typical timestamps provide a potential signaling channel between incomparable levels. In hierarchical databases, typical timestamps cause peripheral sites to unnecessarily affect the behavior at main sites.Algorithms are presented by which a network node may generate and compare timestamps using timestamp components maintained at dominated nodes in the network. The comparison relation is shown to be acyclic for timestamps produced by the generation algorithm. We discuss ways to safely relax the requirement that the network be a lattice. By example, we show how to modify a simple nonplanar lattice so that the generation algorithm can be applied. Uses of the timestamp generation algorithm in the motivating applications are outlined.