We present distributed optimistic concurrency control schemes for database sharing or shared-disk DBMS promising less communication overhead than locking protocols. We describe a parallel broadcast validation scheme supporting short response times. The use of timestamps permits simple and fast validation as well as an integration solution to the buffer invalidation (coherency) problem. The communication and validation overhead is quantified by simple estimates.