{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:03:28Z","timestamp":1775178208981,"version":"3.50.1"},"reference-count":101,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>The increasing scale and complexity of data mining outputs, such as frequent itemsets, association rules, sequences, and subgraphs have made efficient pattern retrieval a critical, yet underexplored challenge. This review addresses the organisation, indexing, and access strategies, which enable scalable and responsive retrieval of structured patterns. We examine the underlying types of data and pattern outputs, common retrieval operations, and the variety of query types encountered in practice. Key indexing structures are surveyed, including prefix trees, inverted indices, hash-based approaches, and bitmap-based methods, each suited to different pattern representations and workloads. Storage designs are discussed with attention to metadata annotation, format choices, and redundancy mitigation. Query optimisation strategies are reviewed, emphasising index-aware traversal, caching, and ranking mechanisms. This paper also explores scalability through parallel, distributed, and streaming architectures, and surveys current systems and tools, which integrate mining and retrieval capabilities. Finally, we outline pressing challenges and emerging directions, such as supporting real-time and uncertainty-aware retrieval, and enabling semantic, cross-domain pattern access. Additional frontiers include privacy-preserving indexing and secure query execution, along with integration of repositories into machine learning pipelines for hybrid symbolic\u2013statistical workflows. We further highlight the need for dynamic repositories, probabilistic semantics, and community benchmarks to ensure that progress is measurable and reproducible across domains. This review provides a comprehensive foundation for designing next-generation pattern retrieval systems, which are scalable, flexible, and tightly integrated into analytic workflows. The analysis and roadmap offered are relevant across application areas including finance, healthcare, cybersecurity, and retail, where robust and interpretable retrieval is essential.<\/jats:p>","DOI":"10.3390\/bdcc9100258","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T05:48:21Z","timestamp":1760420901000},"page":"258","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1183-9878","authenticated-orcid":false,"given":"Paraskevas","family":"Koukaras","sequence":"first","affiliation":[{"name":"School of Science and Technology, International Hellenic University, 14th km Thessaloniki-Moudania, 57001 Thessaloniki, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8263-9024","authenticated-orcid":false,"given":"Christos","family":"Tjortjis","sequence":"additional","affiliation":[{"name":"School of Science and Technology, International Hellenic University, 14th km Thessaloniki-Moudania, 57001 Thessaloniki, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"e1329","DOI":"10.1002\/widm.1329","article-title":"Frequent Itemset Mining: A 25 Years Review","volume":"9","author":"Luna","year":"2019","journal-title":"Wires Data Min. Knowl. Discov."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","article-title":"A Survey of Utility-Oriented Pattern Mining","volume":"33","author":"Gan","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"3063","DOI":"10.1007\/s10489-020-01922-x","article-title":"Cluster-Based Information Retrieval Using Pattern Mining","volume":"51","author":"Djenouri","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.14778\/3636218.3636223","article-title":"Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs","volume":"17","author":"Cai","year":"2023","journal-title":"Proc. VLDB Endow."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10115-015-0830-y","article-title":"A survey on indexing techniques for big data: Taxonomy and performance evaluation","volume":"46","author":"Gani","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"103401","DOI":"10.1016\/j.advengsoft.2022.103401","article-title":"Optimization assisted frequent pattern mining for data replication in cloud: Combining sealion and grey wolf algorithm","volume":"176","author":"Rambabu","year":"2023","journal-title":"Adv. Eng. Softw."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Gan, W., Wu, Y., Nouioua, M., Song, W., Truong, T., and Van, H. (2022). Pattern Mining: Current Challenges and Opportunities. Database Systems for Advanced Applications\u2014DASFAA 2022 Workshops, Springer.","DOI":"10.1007\/978-3-031-11217-1_3"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1007\/s10489-020-01664-w","article-title":"A general-purpose distributed pattern mining system","volume":"50","author":"Belhadi","year":"2020","journal-title":"Appl. Intell."},{"key":"ref_9","unstructured":"Christian, M.A., Nathanael, N., Mauliani, A., Indrawati, A., Manik, L.P., and Akbar, Z. (2011, January 5\u20136). Real Market Basket Analysis using Apriori and Frequent Pattern Tree Algorithm. Proceedings of the 2021 International Conference on Computer,  Control, Informatics and Its Applications, Virtual. IC3INA\u201921."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"103577","DOI":"10.1016\/j.ipm.2023.103577","article-title":"A scalable and flexible basket analysis system for big transaction data in Spark","volume":"61","author":"Sun","year":"2024","journal-title":"Inf. Process. Manag."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Lefoane, M., Ghafir, I., Kabir, S., and Awan, I.U. (2023, January 21\u201322). Sequential Pattern Mining: A Proposed Approach for Intrusion Detection Systems. Proceedings of the 7th International Conference on Future Networks and Distributed Systems, Dubai, United Arab Emirates. ICFNDS\u201923.","DOI":"10.1145\/3644713.3644803"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ozdayi, M.S., Singh, A., and Acar, U. (2020). Leveraging Blockchain for Immutable Logging and Querying of Genomic Data. BMC Med. Genom., 13.","DOI":"10.1186\/s12920-020-0721-2"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1093\/bioinformatics\/btaa693","article-title":"GeoMine: Interactive pattern mining of protein\u2013ligand interfaces in the Protein Data Bank","volume":"37","author":"Diedrich","year":"2020","journal-title":"Bioinformatics"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1007\/s00778-024-00864-x","article-title":"Survey of vector database management systems","volume":"33","author":"Pan","year":"2024","journal-title":"VLDB J."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/3639315","article-title":"A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction","volume":"2","author":"Zhang","year":"2024","journal-title":"Proc. ACM Manag. Data"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/3653317","article-title":"Semantic data integration and querying: A survey and challenges","volume":"56","author":"Masmoudi","year":"2024","journal-title":"ACM Comput. Surv."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"e1307","DOI":"10.1002\/widm.1307","article-title":"A survey on association rules mining using heuristics","volume":"9","author":"Ghafari","year":"2019","journal-title":"WIREs Data Min. Knowl. Discov."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Boghey, R., and Singh, S. (2013, January 6\u20138). Sequential Pattern Mining: A Survey on Approaches. Proceedings of the 2013 International Conference on Communication Systems and Network Technologies, Gwalior, India.","DOI":"10.1109\/CSNT.2013.142"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/3589326","article-title":"Efficient gpu-accelerated subgraph matching","volume":"1","author":"Sun","year":"2023","journal-title":"Proc. Acm Manag. Data"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., and Leskovec, J. (2017, January 6\u201310). Motifs in Temporal Networks. Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, Cambridge, UK. WSDM\u201917.","DOI":"10.1145\/3018661.3018731"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s002360050048","article-title":"The Log-Structured Merge-Tree (LSM-Tree)","volume":"33","author":"Cheng","year":"1996","journal-title":"Acta Inform."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/3033273","article-title":"WiscKey: Separating Keys from Values in SSD-Conscious Storage","volume":"13","author":"Lu","year":"2017","journal-title":"ACM Trans. Storage"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/296854.277632","article-title":"Inverted files versus signature files for text indexing","volume":"23","author":"Zobel","year":"1998","journal-title":"ACM Trans. Database Syst."},{"key":"ref_24","unstructured":"Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., and Schmidt, L. (2015). Practical and Optimal LSH for Angular Distance. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Tatti, N., and Vreeken, J. (2012, January 12\u201316). The Long and the Short of It: Summarising Event Sequences with Serial Episodes. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China.","DOI":"10.1145\/2339530.2339606"},{"key":"ref_26","unstructured":"Boulicaut, J.F., De Raedt, L., and Mannila, H. (2004, January 11\u201313). A Survey on Condensed Representations for Frequent Sets. Proceedings of the Constraint-Based Mining and Inductive Databases, Hinterzarten, Germany."},{"key":"ref_27","unstructured":"Han, W.S., Lee, J., and Lee, J.H. (2013, January 22\u201327). Turboiso: Towards ultrafast and robust subgraph isomorphism search in large graph databases. Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, New York, NY, USA. SIGMOD\u201913."},{"key":"ref_28","unstructured":"Abdelhamid, E., Abdelaziz, I., Khayyat, Z., and Kalnis, P. (2019, January 26). Pivoted Subgraph Isomorphism: The Optimist, the Pessimist and the Realist. Proceedings of the 22nd International Conference on Extending Database Technology (EDBT), Lisbon, Portugal. EDBT 2019."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Wang, L., Metzler, D., and Lin, J. (2010, January 26\u201330). Ranking under temporal constraints. Proceedings of the 19th ACM International Conference on Information and Knowledge Management, Toronto, ON, Canada. CIKM\u201910.","DOI":"10.1145\/1871437.1871452"},{"key":"ref_30","first-page":"227","article-title":"Memory-efficient sequential pattern mining with hybrid tries","volume":"25","author":"Hosseininasab","year":"2024","journal-title":"J. Mach. Learn. Res."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Chen, J., Yang, S., Ding, W., Li, P., Liu, A., Zhang, H., and Li, T. (2024). Incremental high average-utility itemset mining: Survey and challenges. Sci. Rep., 14.","DOI":"10.1038\/s41598-024-60279-0"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"e1","DOI":"10.1017\/S0269888925000013","article-title":"Mining of high utility itemsets from incremental datasets: A survey","volume":"40","author":"Kumar","year":"2025","journal-title":"Knowl. Eng. Rev."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10844-024-00899-0","article-title":"Exploring the trie of rules: A fast data structure for the representation of association rules","volume":"63","author":"Kudriavtsev","year":"2024","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Wang, K., Liu, T., Han, J., and Liu, J. (2002, January 6\u20138). Top down fp-growth for association rule mining. Proceedings of the Advances in Knowledge Discovery and Data Mining, Taipei, Taiwan. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-47887-6_34"},{"key":"ref_35","unstructured":"Chen, D., Lai, C., Hu, W., Chen, W., Zhang, Y., and Zheng, W. (2006, January 25\u201329). Tree partition based parallel frequent pattern mining on shared memory systems. Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium, Rhodes Island, Greece."},{"key":"ref_36","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":"SIGMOD Rec."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Cerdeira-Pena, A., de Bernardo, G., and Navarro, G. (2019, January 3\u20137). Improved Compressed String Dictionaries. Proceedings of the 28th ACM International Conference on Information and Knowledge Management, Beijing, China. CIKM\u201919.","DOI":"10.1145\/3357384.3357972"},{"key":"ref_38","first-page":"1495","article-title":"Constraint-based sequential pattern mining with decision diagrams","volume":"33","author":"Hosseininasab","year":"2019","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref_39","unstructured":"Trotman, A. (2014, January 27\u201328). Compression, SIMD, and Postings Lists. Proceedings of the 19th Australasian Document Computing Symposium, Melbourne, VIC, Australia. ADCS\u201914."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"195111","DOI":"10.1109\/ACCESS.2024.3521285","article-title":"Inverted Index Automata Frequent Itemset Mining for Large Dataset Frequent Itemset Mining","volume":"12","author":"Dai","year":"2024","journal-title":"IEEE Access"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Gupta, D., and Batra, S. (2017, January 5\u20136). A short survey on bloom filter and its variants. Proceedings of the 2017 International Conference on Computing, Communication and Automation (ICCCA), Greater Noida, India.","DOI":"10.1109\/CCAA.2017.8229957"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"103306","DOI":"10.1016\/j.ipm.2023.103306","article-title":"Double locality sensitive hashing Bloom filter for high-dimensional streaming anomaly detection","volume":"60","author":"Zeng","year":"2023","journal-title":"Inf. Process. Manag."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/1269899.1254916","article-title":"Building high accuracy bloom filters using partitioned hashing","volume":"35","author":"Hao","year":"2007","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/spe.2203","article-title":"Decoding Billions of Integers per Second through Vectorization","volume":"45","author":"Lemire","year":"2015","journal-title":"Softw. Pract. Exp."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1002\/spe.2325","article-title":"Better bitmap performance with roaring bitmaps","volume":"46","author":"Chambi","year":"2015","journal-title":"Softw. Pract. Exp."},{"key":"ref_46","first-page":"563","article-title":"Comprehensive Analysis and Comparative Evaluation of Bitmap Indexing Methods for Efficient Data Management","volume":"11","author":"Pratima","year":"2023","journal-title":"Int. J. Intell. Syst. Appl. Eng."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1679","DOI":"10.1007\/s10618-022-00846-z","article-title":"The Minimum Description Length Principle for Pattern Mining: A Survey","volume":"36","author":"Galbrun","year":"2022","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"e5523","DOI":"10.1002\/cpe.5523","article-title":"The Impact of Columnar File Formats on SQL-on-Hadoop Engine Performance: A Study on ORC and Parquet","volume":"32","author":"Ivanov","year":"2020","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.jbi.2016.10.015","article-title":"Evaluation of Relational and NoSQL Database Architectures to Manage Genomic Annotations","volume":"64","author":"Schulz","year":"2016","journal-title":"J. Biomed. Inform."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/3653314","article-title":"Tackling Challenges in Implementing Large-Scale Graph Databases","volume":"67","author":"Arroyuelo","year":"2024","journal-title":"Commun. ACM"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"C\u00fcppers, J., and Vreeken, J. (2023, January 6\u201310). Below the Surface: Summarizing Event Sequences with Generalized Sequential Patterns. Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Long Beach, CA, USA. KDD\u201923.","DOI":"10.1145\/3580305.3599264"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"103830","DOI":"10.1016\/j.engappai.2020.103830","article-title":"Condensed Representations of Changes in Dynamic Graphs through Emerging Subgraph Mining","volume":"94","author":"Impedovo","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","article-title":"Fast Algorithms for Frequent Itemset Mining Using FP-Trees","volume":"17","author":"Grahne","year":"2005","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","article-title":"An Efficient Algorithm for Discovering Frequent Subgraphs","volume":"16","author":"Kuramochi","year":"2004","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391729.1391730","article-title":"A Survey of Top-k Query Processing Techniques in Relational Database Systems","volume":"40","author":"Ilyas","year":"2008","journal-title":"ACM Comput. Surv."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"5351","DOI":"10.14778\/3750601.3750669","article-title":"GooseDB: A Database Engine that Optimally Refines top-k Queries to Satisfy Representation Constraints","volume":"18","author":"Chen","year":"2025","journal-title":"Proc. VLDB Endow."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/spe.960","article-title":"A Survey of Practical Algorithms for Suffix Tree Construction in External Memory","volume":"40","author":"Barsky","year":"2010","journal-title":"Softw. Pract. Exp."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3439724","article-title":"A Survey on Distributed Graph Pattern Matching in Massive Graphs","volume":"54","author":"Bouhenni","year":"2020","journal-title":"ACM Comput. Surv."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"104219","DOI":"10.1016\/j.artint.2024.104219","article-title":"PathLAD+: Towards effective exact methods for subgraph isomorphism problem","volume":"337","author":"Wang","year":"2024","journal-title":"Artif. Intell."},{"key":"ref_60","unstructured":"Shim, J., Scheuermann, P., and Vingralek, R. (1999, January 30). Dynamic caching of query results for decision support systems. Proceedings of the Eleventh International Conference on Scientific and Statistical Database Management, Cleveland, OH, USA."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Oh, H., Zhang, W., Rickett, C.D., Sukumar, S.R., and Byna, S. (2024, January 15\u201318). Evaluating Performance Trade-offs of Caching Strategies for AI-Powered Querying Systems. Proceedings of the 2024 IEEE International Conference on Big Data (BigData), Washington, DC, USA.","DOI":"10.1109\/BigData62323.2024.10825819"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TKDE.2013.109","article-title":"Data Mining with Big Data","volume":"26","author":"Wu","year":"2014","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","article-title":"LSM-based storage techniques: A survey","volume":"29","author":"Luo","year":"2019","journal-title":"VLDB J."},{"key":"ref_64","unstructured":"Guo, S., and Gao, H. (2017, January 2\u20134). An efficient algorithm for incremental and interactive high utility itemset mining. Proceedings of the 2017 2nd International Conference on Image, Vision and Computing (ICIVC), Chengdu, China."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Hsiao, W.T., Kan, Y.C., Kuo, C.C., Kuo, Y.C., Chai, S.K., and Lin, H.C. (2022). Hybrid-Pattern Recognition Modeling with Arrhythmia Signal Processing for Ubiquitous Health Management. Sensors, 22.","DOI":"10.3390\/s22020689"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1002\/int.22269","article-title":"Efficiently mining erasable stream patterns for intelligent systems over uncertain data","volume":"35","author":"Baek","year":"2020","journal-title":"Int. J. Intell. Syst."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2523813","article-title":"A Survey on Concept Drift Adaptation","volume":"46","author":"Gama","year":"2014","journal-title":"ACM Comput. Surv."},{"key":"ref_68","first-page":"36","article-title":"The SPMF Open-Source Data Mining Library Version 2","volume":"Volume 9853","author":"Lin","year":"2016","journal-title":"Machine Learning and Knowledge Discovery in Databases (ECML PKDD 2016), Part III"},{"key":"ref_69","first-page":"3569","article-title":"SPMF: A Java Open-Source Pattern Mining Library","volume":"15","author":"Gomariz","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1002\/widm.1074","article-title":"Frequent Item Set Mining","volume":"2","author":"Borgelt","year":"2012","journal-title":"WIREs Data Min. Knowl. Discov."},{"key":"ref_71","first-page":"2349","article-title":"Orange: Data Mining Toolbox in Python","volume":"14","author":"Curk","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"638","DOI":"10.21105\/joss.00638","article-title":"MLxtend: Providing Machine Learning and Data Science Utilities and Extensions to Python\u2019s Scientific Computing Stack","volume":"3","author":"Raschka","year":"2018","journal-title":"J. Open Source Softw."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"2917","DOI":"10.1109\/TVCG.2012.219","article-title":"Enterprise Data Analysis and Visualization: An Interview Study","volume":"18","author":"Kandel","year":"2012","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Yang, F., Tschetter, E., L\u00e9aut\u00e9, X., Ray, N., Merlino, G., and Ganguli, D. (2014, January 22\u201327). Druid: A real-time analytical data store. Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, Snowbird, UT, USA. SIGMOD\u201914.","DOI":"10.1145\/2588555.2595631"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"3731","DOI":"10.14778\/3685800.3685802","article-title":"ClickHouse\u2014Lightning Fast Analytics for Everyone","volume":"17","author":"Schulze","year":"2024","journal-title":"Proc. VLDB Endow."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1007\/s11276-018-01896-2","article-title":"A framework for social media data analytics using elasticsearch and kibana","volume":"28","author":"Shah","year":"2018","journal-title":"Wirel. Netw."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.foodqual.2013.12.004","article-title":"Stability of market segmentation with cluster analysis\u2014A methodological approach","volume":"34","author":"Hamm","year":"2014","journal-title":"Food Qual. Prefer."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"e1575","DOI":"10.1002\/wics.1575","article-title":"Stability estimation for unsupervised clustering: A review","volume":"14","author":"Liu","year":"2022","journal-title":"WIREs Comput. Stat."},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","article-title":"Network Applications of Bloom Filters: A Survey","volume":"1","author":"Broder","year":"2004","journal-title":"Internet Math."},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2508037.2508044","article-title":"A Temporal Pattern Mining Approach for Classifying Electronic Health Record Data","volume":"4","author":"Batal","year":"2013","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3127881","article-title":"Mining Electronic Health Records (EHRs): A Survey","volume":"50","author":"Yadav","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1093\/jamia\/ocab084","article-title":"The Use of SNOMED CT, 2013\u20132020: A Literature Review","volume":"28","author":"Chang","year":"2021","journal-title":"J. Am. Med. Inform. Assoc."},{"key":"ref_83","first-page":"2346","article-title":"Learning under Concept Drift: A Review","volume":"31","author":"Lu","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_84","unstructured":"Cahill, M.J., R\u00f6hm, U., and Fekete, A.D. (2008, January 9\u201312). Serializable Snapshot Isolation in PostgreSQL. Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, BC, Canada."},{"key":"ref_85","first-page":"38","article-title":"Spanner: Google\u2019s Globally-Distributed Database","volume":"56","author":"Corbett","year":"2013","journal-title":"Commun. ACM"},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Bifet, A., and Gavald\u00e0, R. (2007, January 26\u201328). Learning from Time-Changing Data with Adaptive Windowing. Proceedings of the 2007 SIAM International Conference on Data Mining, Minneapolis, MN, USA.","DOI":"10.1137\/1.9781611972771.42"},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"3843","DOI":"10.1016\/j.ins.2009.07.012","article-title":"Sliding Window-Based Frequent Pattern Mining over Data Streams","volume":"179","author":"Tanbeer","year":"2009","journal-title":"Inf. Sci."},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.14778\/3523210.3523218","article-title":"An in-depth study of continuous subgraph matching","volume":"15","author":"Sun","year":"2022","journal-title":"Proc. VLDB Endow."},{"key":"ref_89","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1007\/s10115-022-01753-x","article-title":"A survey of continuous subgraph matching for dynamic graphs","volume":"65","author":"Wang","year":"2022","journal-title":"Knowl. Inf. Syst."},{"key":"ref_90","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1561\/1900000052","article-title":"Query Processing on Probabilistic Data: A Survey","volume":"7","author":"Suciu","year":"2017","journal-title":"Found. Trends Databases"},{"key":"ref_91","unstructured":"Thankachan, S.V., Patil, M., Shah, R., and Biswas, S. (2016, January 15\u201318). Probabilistic Threshold Indexing for Uncertain Strings. Proceedings of the 19th International Conference on Extending Database Technology (EDBT), Bordeaux, France."},{"key":"ref_92","doi-asserted-by":"crossref","unstructured":"Huang, J., Antova, L., Koch, C., and Olteanu, D. (July, January 29). MayBMS: A Probabilistic Database Management System. Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, Providence, RI, USA.","DOI":"10.1145\/1559845.1559984"},{"key":"ref_93","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1007\/s10115-022-01681-w","article-title":"A Survey on Mining and Analysis of Uncertain Graphs","volume":"2","author":"Banerjee","year":"2022","journal-title":"Knowl. Inf. Syst."},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3447772","article-title":"Knowledge Graphs","volume":"54","author":"Hogan","year":"2021","journal-title":"ACM Comput. Surv."},{"key":"ref_95","doi-asserted-by":"crossref","first-page":"D267","DOI":"10.1093\/nar\/gkh061","article-title":"The Unified Medical Language System (UMLS): Integrating Biomedical Terminology","volume":"32","author":"Bodenreider","year":"2004","journal-title":"Nucleic Acids Res."},{"key":"ref_96","doi-asserted-by":"crossref","unstructured":"Grover, A., and Leskovec, J. (2016, January 13\u201317). node2vec: Scalable Feature Learning for Networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939754"},{"key":"ref_97","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","article-title":"A Survey on Network Embedding","volume":"31","author":"Cui","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_98","first-page":"119","article-title":"A survey on searchable symmetric encryption","volume":"56","author":"Li","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"ref_99","doi-asserted-by":"crossref","unstructured":"Yan, L., Wang, G., Yin, T., Liu, P., Feng, H., Zhang, W., Hu, H., and Pan, F. (2024). Attribute-Based Searchable Encryption: A Survey. Electronics, 13.","DOI":"10.3390\/electronics13091621"},{"key":"ref_100","first-page":"18","article-title":"A Survey of Provably Secure Searchable Encryption","volume":"47","author":"Hartel","year":"2014","journal-title":"ACM Comput. Surv."},{"key":"ref_101","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1186\/s42400-024-00213-z","article-title":"A privacy-preserving image retrieval scheme with access control based on searchable encryption in media cloud","volume":"7","author":"Tian","year":"2024","journal-title":"Cybersecurity"}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/9\/10\/258\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:33:51Z","timestamp":1760423631000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/9\/10\/258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,13]]},"references-count":101,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["bdcc9100258"],"URL":"https:\/\/doi.org\/10.3390\/bdcc9100258","relation":{},"ISSN":["2504-2289"],"issn-type":[{"value":"2504-2289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,13]]}}}