Suppose that we have an existing transaction database tdb for which we have already mined the frequent patterns. also we have a new set of transaction δtdb that we are adding to tdb. given a fixed min support threshold, σ (e. g., σ = 0.5%), present in plain language the steps for an efficient incremental mining algorithm that can maximally use the previously mined information when a new set of transactions δtdb is added to the existing transaction database tdb.