{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T15:36:59Z","timestamp":1767713819530,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T00:00:00Z","timestamp":1756339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Frequent pattern mining is a fundamental method for Data Mining, applicable in market basket analysis, recommendation systems, and academic analytics. Widely adopted and foundational algorithms such as Apriori and FP-Growth, which represent the standard approaches in frequent pattern mining, face limitations related to candidate set generation and memory usage, especially when applied to extensive relational datasets. This work presents the Recursive Queried Frequent Patterns (RQFP) algorithm, an SQL-based approach that utilizes recursive queries on relational Mining Tables to detect frequent itemsets without the need for explicit candidate development. The algorithm was implemented using a Microsoft SQL Server and demonstrated through a custom-developed C# web application interface. RQFP facilitates easy integration with database systems and enhances result interpretability. Comparative analyses of Apriori and FP-Growth on an academic dataset reveal competitive efficacy, accompanied with diminished memory requirements and enhanced clarity in pattern extraction. The paper further contextualizes RQFP using benchmark datasets from the previous literature and delineates a roadmap for future evaluations in healthcare and retail data. The existing implementation is educational, although the technique demonstrates the potential for scalable, database-native pattern mining.<\/jats:p>","DOI":"10.3390\/info16090746","type":"journal-article","created":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T15:03:14Z","timestamp":1756393394000},"page":"746","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recursive Queried Frequent Patterns Algorithm: Determining Frequent Pattern Sets from Database"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9958-2316","authenticated-orcid":false,"given":"Ishtiyaq Ahmad","family":"Khan","sequence":"first","affiliation":[{"name":"Academic Delivery and Student Success, upGrad Education Private Limited, Bangalore 560071, Karnataka, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5542-0460","authenticated-orcid":false,"given":"Hsin-Yuan","family":"Chen","sequence":"additional","affiliation":[{"name":"Center for Digital Technology Innovation and Entrepreneurship, Institute of Wenzhou, Zhejiang University, Wenzhou 325000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3102-0808","authenticated-orcid":false,"given":"Shamneesh","family":"Sharma","sequence":"additional","affiliation":[{"name":"Customer Success and Quality Control, byteXL TechEd Private Limited, Hyderabad 500081, Telangana, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5401-8503","authenticated-orcid":false,"given":"Chetan","family":"Sharma","sequence":"additional","affiliation":[{"name":"PW-Institute of Innovation, PhysicsWallah Limited, Lucknow 226030, Uttar Pradesh, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,8,28]]},"reference":[{"key":"ref_1","first-page":"1220","article-title":"A Theoretical Review on Data Mining and Machine Learning Techniques for Data Analysis","volume":"29","year":"2020","journal-title":"Int. J. Adv. Sci. Technol."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Chakraborty, M., Biswas, S.K., and Purkayastha, B. (2020, January 27\u201329). Data Mining Using Neural Networks in the form of Classification Rules: A Review. Proceedings of the 2020 4th International Conference on Computational Intelligence and Networks (CINE), Kolkata, India.","DOI":"10.1109\/CINE48825.2020.234399"},{"key":"ref_3","unstructured":"de Sousa, L.R., de Carvalho, V.O., Penteado, B.E., and Affonso, F.J. (2021, January 23\u201325). A Systematic Mapping on the Use of Data Mining for the Face-to-Face School Dropout Problem. Proceedings of the 13th International Conference on Computer Supported Education (CSEDU 2021), Online Streaming."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"e1395","DOI":"10.1002\/widm.1395","article-title":"Scholarly data mining: A systematic review of its applications","volume":"11","author":"Dridi","year":"2021","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1109\/TETCI.2021.3067017","article-title":"Frequent Pattern Mining in Big Social Graphs","volume":"6","author":"Li","year":"2022","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., and Swami, A. (1993, January 25\u201328). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA.","DOI":"10.1145\/170035.170072"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"42786","DOI":"10.1109\/ACCESS.2021.3065393","article-title":"A Survey of Correlated High Utility Pattern Mining","volume":"9","author":"Almoqbily","year":"2021","journal-title":"IEEE Access"},{"key":"ref_8","unstructured":"Jazayeri, A., and Yang, C.C. (2021). Frequent Pattern Mining in Continuous-time Temporal Networks. arXiv."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3439771","article-title":"Exploring decomposition for solving pattern mining problems","volume":"12","author":"Djenouri","year":"2021","journal-title":"ACM Trans. Manag. Inf. Syst. (TMIS)"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Han, J., Kamber, M., and Pei, J. (2012). Data mining trends and research frontiers. Data Mining, University of Illinois at Urbana\u2013Champaign.","DOI":"10.1016\/B978-0-12-381479-1.00013-7"},{"key":"ref_11","unstructured":"Chi, Y., Wang, H., Yu, P.S., and Muntz, R.R. (2004, January 1\u20134). Moment: Maintaining closed frequent itemsets over a stream sliding window. Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM\u201904), Brighton, UK."},{"key":"ref_12","unstructured":"Fard, M.J.S., and Namin, P.A. (2020, January 22\u201323). Review of Apriori based Frequent Itemset Mining Solutions on Big Data. Proceedings of the 2020 6th International Conference on Web Research (ICWR), Tehran, Iran."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Liu, C., and Li, X. (2021). Mining Method Based on Semantic Trajectory Frequent Pattern. Advanced Information Networking and Applications, Proceedings of the International Conference on Advanced Information Networking and Applications, Toronto, ON, Canada, 12\u201314 May 2021, Springer.","DOI":"10.1007\/978-3-030-75075-6_12"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"390","DOI":"10.11591\/eei.v10i1.2096","article-title":"An efficient apriori algorithm for frequent pattern mining using mapreduce in healthcare data","volume":"10","author":"Sornalakshmi","year":"2021","journal-title":"Bull. Electr. Eng. Inform."},{"key":"ref_15","unstructured":"Han, J., and Fu, Y. (1995, January 11\u201315). Discovery of multiple-level association rules from large databases. Proceedings of the 21st VLDB Conference, Zurich, Swizerland."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Dong, G., and Wang, K. (2001, January 21\u201324). Efficient computation of iceberg cubes with complex measures. Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, USA.","DOI":"10.1145\/375663.375664"},{"key":"ref_17","unstructured":"Clustering, P.-B. (2021). Grouping of Questions From a Question Bank Using Partition-Based Clustering. Developing a Keyword Extractor and Document Classifier: Emerging Research and Opportunities, Engineering Science Reference."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","article-title":"Mining frequent patterns without candidate generation","volume":"29","author":"Han","year":"2000","journal-title":"ACM Sigmod Rec."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chormunge, S., and Mehta, R. (2021). Comparison Analysis of Extracting Frequent Itemsets Algorithms Using MapReduce. Intelligent Data Communication Technologies and Internet of Things, Proceedings of the ICICI 2020, Coimbatore, India, 27\u201328 August 2020, Springer.","DOI":"10.1007\/978-981-15-9509-7_17"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","article-title":"Parallel mining of association rules","volume":"8","author":"Agrawal","year":"1996","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_21","unstructured":"Han, J., Dong, G., and Yin, Y. (1999, January 23\u201326). Efficient mining of partial periodic patterns in time series database. Proceedings of the 15th International Conference on Data Engineering (Cat. No. 99CB36337), Sydney, NSW, Australia."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"55726","DOI":"10.1109\/ACCESS.2021.3071777","article-title":"Incremental Association Rule Mining With a Fast Incremental Updating Frequent Pattern Growth Algorithm","volume":"9","author":"Thurachon","year":"2021","journal-title":"IEEE Access"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Cong, S., Han, J., and Padua, D. (2005, January 21\u201324). Parallel mining of closed sequential patterns. Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, Chicago, IL, USA.","DOI":"10.1145\/1081870.1081937"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"136511","DOI":"10.1109\/ACCESS.2019.2943015","article-title":"Incremental frequent itemsets mining with FCFP tree","volume":"7","author":"Sun","year":"2019","journal-title":"IEEE Access"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. (1998, January 3\u20137). Efficient enumeration of frequent sequences. Proceedings of the Seventh International Conference on Information and Knowledge Management, Bethesda, MD, USA.","DOI":"10.1145\/288627.288643"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Bernal, J.N., Rodriguez, J.P., and Portella, J. (2021). DBMS and Oracle Datamining. Preprints.","DOI":"10.20944\/preprints202103.0640.v1"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"68","DOI":"10.17706\/IJCCE.2021.10.3.68-74","article-title":"A Critical Review of SQL-Based Mining Relational Database","volume":"10","author":"Teng","year":"2021","journal-title":"Int. J. Comput. Commun. Eng."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"390","DOI":"10.12928\/telkomnika.v19i2.16192","article-title":"Frequent pattern growth algorithm for maximizing display items","volume":"19","author":"Nasyuha","year":"2021","journal-title":"Telkomnika"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Afrati, F., Gionis, A., and Mannila, H. (2004, January 22\u201325). Approximating a collection of frequent sets. Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, USA.","DOI":"10.1145\/1014052.1014057"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","article-title":"A tree projection algorithm for generation of frequent item sets","volume":"61","author":"Agarwal","year":"2001","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., and Yu, P.S. (1998, January 1\u20134). A new framework for itemset generation. Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, WA, USA.","DOI":"10.1145\/275487.275490"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Beil, F., Ester, M., and Xu, X. (2002, January 23\u201326). Frequent term-based text clustering. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada.","DOI":"10.1145\/775107.775110"},{"key":"ref_33","unstructured":"Agrawal, R., and Srikant, R. (1995, January 6\u201310). Mining sequential patterns. Proceedings of the Eleventh International Conference on Data Engineering, Taipei, Taiwan."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/9\/746\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:34:44Z","timestamp":1760034884000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/9\/746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,28]]},"references-count":33,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["info16090746"],"URL":"https:\/\/doi.org\/10.3390\/info16090746","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2025,8,28]]}}}