▁ ▁The ▁algorithm ▁sc ans ▁the ▁database ▁too ▁many ▁times , ▁ ▁which ▁reduces ▁the ▁overall ▁performance . ▁Due ▁to ▁this , ▁the ▁algorithm ▁assumes ▁that ▁the ▁database ▁is ▁P erman ent ▁in ▁the ▁memory . ▁▁ ▁Also , ▁both ▁the ▁time ▁and ▁space ▁complexity ▁of ▁this ▁algorithm ▁are ▁very ▁high : ▁, ▁thus ▁exponential , ▁where ▁ ▁is ▁the ▁horizontal ▁width ▁( the ▁total ▁number ▁of ▁items ) ▁present ▁in ▁the ▁database . ▁ ▁Later ▁algorithms ▁such ▁as ▁Max - M iner ▁try ▁to ▁identify ▁the ▁maximal ▁frequent ▁item ▁sets ▁without ▁enumer ating ▁their ▁subsets , ▁and ▁perform ▁" j umps " ▁in ▁the ▁search ▁space ▁rather ▁than ▁a ▁purely ▁bottom - up ▁approach . ▁ ▁References ▁ ▁External ▁links ▁ ▁AR tool , ▁G PL ▁Java ▁association ▁rule ▁min ing ▁application ▁with ▁GUI , ▁offering ▁implementations ▁of ▁multiple ▁algorithms ▁for ▁discovery ▁of ▁frequent ▁patterns ▁and ▁extra ction ▁of ▁association ▁rules ▁( includes ▁Ap ri ori ) ▁ ▁SP M F ▁offers ▁Java ▁open - source ▁implementations ▁of ▁Ap ri ori ▁and ▁several ▁variations ▁such ▁as ▁Ap ri ori Close , ▁U Ap ri ori , ▁Ap ri ori In verse , ▁Ap ri ori R are , ▁M SA p ri ori , ▁Ap ri ori T ID , ▁and ▁other ▁more ▁efficient ▁algorithms ▁such ▁as ▁F PG row th ▁and ▁L CM . ▁▁ ▁Christian ▁Borg elt ▁provides ▁C ▁implementations ▁for ▁Ap ri ori ▁and ▁many ▁other ▁frequent ▁pattern ▁min ing ▁algorithms ▁( E cl at , ▁F PG row