Optimistic and conservative locking strategies are two different mechanics of concurrency control in distributed data base management systems (DDBMS). This paper proposes a method which combines the above two strategies and awakes it possible to dynamically select the way of transaction processing according to the real recent state of the system, to reduce deadlock and to make the system itself more efficent in concurrency control while remain both features of these two strategies.