Data Warehouse Systems (DWS) make use of storage techniques for efficient end user accessing and query facilities. DWS applications have implemented classic data synchronism operations that do not support an immediate data update. With the evolution of semantic data representation in the operational database environment, the accomplished analysis in DWS demands new synchronism ways. Hence, there is a growing interest in DWS that can rapidly absorb the operational database updates, without compromising the operational query processes. Our research aims at the characterization of the synchronous and asynchronous algorithms limits for data updating in a DWS. This research proposes another way for update propagations of asynchronous transactions in DWS, the dw-log algorithm. The dw-log algorithm implementation is supported by the process algebra approach.