Abstract: Bridge rules provide an important mechanism describing semantic mapping and propagating knowledge for D3L (distributed dynamic description logics). The current research focuses on the homogeneous bridge rules which only contain atomic elements. In this paper, the research is extended to the D3L reasoning problem with the heterogeneous bridge rules which contain composite elements in the contained end. The regularity of distributed knowledge base is defined. Through the alternation of the bridge rules and transforming different forms into existing language mechanism, we present a algorithm which can convert the D3L knowledge base with dynamic description logic DSROIQ as local ontology language into a single DSROIQ knowledge base. Then we study the properties of the algorithm. We prove that the algorithm will terminate in polynomial time and the satisfiability of the target knowledge base is equivalent to the satisfiability of the original knowledge base. Thus, we prove that the worst-case time complexity of the centralized reasoning on regular D3L knowledge base with such bridge rules is the same as that on single DSROIQ knowledge base. The method proposed in this paper makes the reasoning for D3L to obtain the same worst-case time complexity as the existing distributed reasoning methods and solves the problem that the latter can not handle heterogeneous composite bridge rules.