The paper seeks to generate large itemsets in a dynamic transaction database using immune clone algorithm. Intra transactions, Inter transactions and distributed transactions are considered for mining association rules. The time of complexity of DMARICA (Dynamic Mining of Association Rules using Immune Clone Algorithm) is analyzed, with Fast Updata (FUP) algorithm for intra transactions and E-Apriori for inter transactions. The problem of mining association rules in the distributed environment is explored by Distributed DMARICA (DDMARICA). The study shows that DMARICA outperforms both FUP and E-Apriori in terms of execution time and scalability, without comprising the quality or completeness of rules generated. DMARICA is also compared with DMARG(Dynamic Mining of Association Rules using Genetic Algorithm). And it has better performance than that of DMARG.