Iterative Algorithm for Finding Frequent Patterns in Transactional Databases
Gennady P. Berman, Vyacheslav N. Gorshkov, Edward P. MacKerrow, Xidi Wang
Abstract
A high-performance algorithm for searching for frequent patterns (FPs) in transactional databases is presented. The search for FPs is carried out by using an iterative sieve algorithm by computing the set of enclosed cycles. In each inner cycle of level FPs composed of elements are generated. The assigned number of enclosed cycles (the parameter of the problem) defines the maximum length of the desired FPs. The efficiency of the algorithm is produced by (i) the extremely simple logical searching scheme, (ii) the avoidance of recursive procedures, and (iii) the usage of only one-dimensional arrays of integers.
Create a lesson
Related papers
Autonomous ETL Pipelines for Salesforce M&A Consolidation: A Reference Framework, Jitterbit Mapping, and Reproducible Simulation Study
Imran Basha Shaik, Sahla Sultana, Khader Moinuddin Shaik
When Is One Query per Template Enough? Adapting Learned Cost Models to New Hardware
Krish Patel
Optimizing Geo-replicated Deterministic Databases
Yunhao Mao, Shiquan Zhang, Gengrui Zhang et al.
BobFlow: Towards Human-Agent Collaborative Data Science Using Dataflows
Jiadong Bai, Yicong Huang, Chen Li
Turbocharging PiPNN for Proximity and k-NN Graph Building
Tobias Rubel, Richard Wen, Guy Blelloch et al.
Whiel: A Neurosymbolic Platform for Certified Relational Program Verification
Jesse Comer, Fangzhu Shen, Shuo Zhang et al.