Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
Open accessThe DOI matches its Crossref record; 90 of the 90 references it cites were found in a registry or an index.
Abstract
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–statistical 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures












Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
The unified medical language system (UMLS): integrating biomedical terminology
Bodenreider, O. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh061 · Cited by 4,356
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735 · cited 1×
“This feature becomes crucial in concept drift situations or analysis across different temporal contexts, where outdated patterns need to be removed or down-ranked [67].”
Wu, X., Zhu, X., Wu, G.-Q., & Ding, W. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.109 · Cited by 2,410
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Hogan, A., Blomqvist, E., Cochez, M., D’amato, C., Melo, G. D., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., et al. (2022) · ACM Computing Surveys · doi:10.1145/3447772 · Cited by 1,904
Learning from Time-Changing Data with Adaptive Windowing
Bifet, A., & Gavaldà, R. (2007) · Proceedings of the 2007 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.42 · Cited by 1,789
Orange: data mining toolbox in python
Demšar, J., Curk, T., Erjavec, A., Gorup, Č., Hočevar, T., Milutinovič, M., Možina, M., Polajnar, M., Toplak, M., Starič, A., et al. (2013) · Journal of Machine Learning Research · Cited by 1,655
Learning under Concept Drift: A Review
Lu, J., Liu, A., Dong, F., Gu, F., Gama, J., & Zhang, G. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2876857 · Cited by 1,603
The log-structured merge-tree (LSM-tree)
O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996) · Acta Informatica · doi:10.1007/s002360050048 · Cited by 1,317
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
A survey of top- k query processing techniques in relational database systems
Ilyas, I. F., Beskales, G., & Soliman, M. A. (2008) · ACM Computing Surveys · doi:10.1145/1391729.1391730 · Cited by 825
Spanner: Google's globally-distributed database
Corbett, J. C., Dean, J. B., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2012) · doi:10.5555/2387880.2387905 · Cited by 807
Raschka, S. (2018) · Journal of Open Source Software · doi:10.21105/joss.00638 · Cited by 617
Fast algorithms for frequent itemset mining using FP-trees
Grahne, G., & Zhu, J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.166 · Cited by 549
The SPMF Open-Source Data Mining Library Version 2
Fournier-Viger, P., Lin, J. C.-W., Gomariz, A., Gueniche, T., Soltani, A., Deng, Z., & Lam, H. T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46131-1_8 · Cited by 549
Paranjape, A., Benson, A. R., & Leskovec, J. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018731 · Cited by 540
Enterprise Data Analysis and Visualization: An Interview Study
Kandel, S., Paepcke, A., Hellerstein, J. M., & Heer, J. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.219 · Cited by 439
SPMF: a Java open-source pattern mining library
Fournier‐Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu, C., & Tseng, V. S. (2014) · Journal of Machine Learning Research · Cited by 420
A Survey of Provably Secure Searchable Encryption
Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2015) · ACM Computing Surveys · doi:10.1145/2636328 · Cited by 357
An efficient algorithm for discovering frequent subgraphs
Kuramochi, M., & Karypis, G. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.33 · Cited by 352
Inverted files versus signature files for text indexing
Zobel, J., Moffat, A., & Ramamohanarao, K. (1998) · ACM Transactions on Database Systems · doi:10.1145/296854.277632 · Cited by 341
WiscKey: Separating Keys from Values in SSD-Conscious Storage
Lu, L., Pillai, T. S., Gopalakrishnan, H., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2017) · ACM Transactions on Storage · doi:10.1145/3033273 · Cited by 301
Mining Electronic Health Records (EHRs): A Survey
Yadav, P., Steinbach, M., Kumar, V., & Simon, G. (2018) · ACM Computing Surveys · doi:10.1145/3127881 · Cited by 299
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
Frequent itemset mining: A 25 years review
Luna, J. M., Fournier‐Viger, P., & Ventura, S. (2019) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1329 · Cited by 258
A survey on indexing techniques for big data: taxonomy and performance evaluation
Gani, A., Siddiqa, A., Shamshirband, S., & Hanum, F. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-015-0830-y · Cited by 257
A Survey of Utility-Oriented Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2942594 · Cited by 257
Decoding billions of integers per second through vectorization
Lemire, D., & Boytsov, L. (2015) · Software: Practice and Experience · doi:10.1002/spe.2203 · Cited by 233
Practical and Optimal LSH for Angular Distance
Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., & Schmidt, L. (2015) · TU/e Research Portal · doi:10.48550/arxiv.1509.02897 · Cited by 201
LSM-based storage techniques: a survey
Luo, C., & Carey, M. J. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00555-y · Cited by 190
Survey of Vector Database Management Systems
Pan, J. J., Wang, J., & Li, G. (2023) · arXiv · doi:10.48550/arxiv.2310.14021 · Cited by 184
Survey of vector database management systems
Pan, J. J., Wang, J., & Li, G. (2024) · The VLDB Journal · doi:10.1007/s00778-024-00864-x · Cited by 173
Druid: a real-time analytical data store
Yang, F., Tschetter, E., Léauté, X., Ray, N., Merlino, G., & Ganguli, D. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2595631 · Cited by 171
Better bitmap performance with Roaring bitmaps
Chambi, S., Lemire, D., Kaser, O., & Godin, R. (2016) · Software: Practice and Experience · doi:10.1002/spe.2325 · Cited by 160
Sliding window-based frequent pattern mining over data streams
Tanbeer, S. K., Ahmed, C. F., Jeong, B.-S., & Lee, Y.-K. (2009) · Information Sciences · doi:10.1016/j.ins.2009.07.012 · Cited by 154
The use of SNOMED CT, 2013-2020: a literature review
Chang, E., & Mostafa, J. (2021) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocab084 · Cited by 152
A temporal pattern mining approach for classifying electronic health record data
Batal, I., Valizadegan, H., Cooper, G. F., & Hauskrecht, M. (2013) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2508037.2508044 · Cited by 147
Stability estimation for unsupervised clustering: A review
Liu, T., Yu, H., & Blair, R. H. (2022) · Wiley Interdisciplinary Reviews Computational Statistics · doi:10.1002/wics.1575 · Cited by 145
Top Down FP-Growth for Association Rule Mining
Wang, K., Liu, T., Han, J., & Liu, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47887-6_34 · Cited by 141
Huang, J., Antova, L., Koch, C. E., & Olteanu, D. (2009) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1559845.1559984 · Cited by 136
Stability of market segmentation with cluster analysis – A methodological approach
Müller, H., & Hamm, U. (2014) · Food Quality and Preference · doi:10.1016/j.foodqual.2013.12.004 · Cited by 103
Pattern Mining: Current Challenges and Opportunities
Fournier‐Viger, P., Gan, W., Wu, Y., Nouioua, M., Song, W. G., Truong, T., & Duong, H. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-11217-1_3 · Cited by 94
The long and the short of it: summarising event sequences with serial episodes
Tatti, N., & Vreeken, J. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339606 · Cited by 85
Query Processing on Probabilistic Data: A Survey
den Broeck, G. V., & Suciu, D. M. (2017) · Foundations and Trends in Databases · doi:10.1561/1900000052 · Cited by 71
A framework for social media data analytics using Elasticsearch and Kibana
Shah, N., Willick, D. L., & Mago, V. (2018) · Wireless Networks · doi:10.1007/s11276-018-01896-2 · Cited by 70
A survey on association rules mining using heuristics
Ghafari, S. M., & Tjortjis, C. (2019) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1307 · Cited by 68
Self-citationA Survey on Distributed Graph Pattern Matching in Massive Graphs
Bouhenni, S., Yahiaoui, S., Nouali‐Taboudjemat, N., & Kheddouci, H. (2021) · ACM Computing Surveys · doi:10.1145/3439724 · Cited by 63
Leveraging blockchain for immutable logging and querying across multiple sites
Özdayi, M. S., Kantarcıoğlu, M., & Malin, B. (2020) · BMC Medical Genomics · doi:10.1186/s12920-020-0721-2 · Cited by 56
Zhang, Z., Lu, Y., Zheng, W., & Lin, X. (2024) · Proceedings of the ACM on Management of Data · doi:10.1145/3639315 · Cited by 54
Cluster-based information retrieval using pattern mining
Djenouri, Y., Belhadi, A., Djenouri, D., & Lin, J. C. (2020) · Applied Intelligence · doi:10.1007/s10489-020-01922-x · Cited by 51
ClickHouse - Lightning Fast Analytics for Everyone
Schulze, R., Schreiber, T., Yatsishin, I., Dahimene, R., & Milovidov, A. (2024) · Proceedings of the VLDB Endowment · doi:10.14778/3685800.3685802 · Cited by 50
A Survey on Searchable Symmetric Encryption
Li, F., Ma, J., Miao, Y., Liu, X., Ning, J., & Deng, R. H. (2023) · ACM Computing Surveys · doi:10.1145/3617991 · Cited by 49
The impact of columnar file formats on SQL‐on‐hadoop engine performance: A study on ORC and Parquet
Ivanov, T., & Pergolesi, M. (2019) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.5523 · Cited by 48
An in-depth study of continuous subgraph matching
Sun, X., Sun, S., Luo, Q., & He, B. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3523210.3523218 · Cited by 47
The minimum description length principle for pattern mining: a survey
Galbrun, E. (2022) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-022-00846-z · Cited by 42
Efficient GPU-Accelerated Subgraph Matching
Sun, X., & Luo, Q. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3589326 · Cited by 42
Ranking under temporal constraints
Wang, L., Metzler, D., & Lin, J. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871452 · Cited by 38
Evaluation of relational and NoSQL database architectures to manage genomic annotations
Schulz, W. L., Nelson, B. G., Felker, D. K., Durant, T. J. S., & Torres, R. (2016) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2016.10.015 · Cited by 38
Attribute-Based Searchable Encryption: A Survey
Li, Y., Wang, G., Yin, T., Liu, P., Feng, H., Zhang, W., Hu, H., & Pan, F. (2024) · Electronics · doi:10.3390/electronics13091621 · Cited by 33
A scalable and flexible basket analysis system for big transaction data in Spark
Sun, X., Ngueilbaye, A., Luo, K., Cai, Y., Wu, D., & Huang, J. Z. (2023) · Information Processing & Management · doi:10.1016/j.ipm.2023.103577 · Cited by 29
A general-purpose distributed pattern mining system
Belhadi, A., Djenouri, Y., Lin, J. C., & Cano, A. (2020) · Applied Intelligence · doi:10.1007/s10489-020-01664-w · Cited by 28
A survey of continuous subgraph matching for dynamic graphs
Wang, X., Zhang, Q., Guo, D., & Zhao, X. H. (2022) · Knowledge and Information Systems · doi:10.1007/s10115-022-01753-x · Cited by 28
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
Cai, X., Ke, X., Wang, K., Chen, L., Zhang, T., Liu, Q., & Gao, Y. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3636218.3636223 · Cited by 25
Efficiently mining erasable stream patterns for intelligent systems over uncertain data
Baek, Y., Yun, U., Lin, J. C., Yoon, E., & Fujita, H. (2020) · International Journal of Intelligent Systems · doi:10.1002/int.22269 · Cited by 23
Building high accuracy bloom filters using partitioned hashing
Fang, H., Kodialam, M. S., & Lakshman, T. V. (2007) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1269899.1254916 · Cited by 22
Semantic Data Integration and Querying: A Survey and Challenges
Masmoudi, M., Lamine, S. B. A. B., Karray, M. H., Archimède, B., & Zghal, H. B. (2024) · ACM Computing Surveys · doi:10.1145/3653317 · Cited by 22
GeoMine: interactive pattern mining of protein–ligand interfaces in the Protein Data Bank
Diedrich, K., Graef, J., Stierand, K., & Rarey, M. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa693 · Cited by 21
Double locality sensitive hashing Bloom filter for high-dimensional streaming anomaly detection
Zeng, Z., Xiao, R., Lin, X., Luo, T.-J., & Lin, J. (2023) · Information Processing & Management · doi:10.1016/j.ipm.2023.103306 · Cited by 21
Rambabu, D., & Govardhan, A. (2023) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2022.103401 · Cited by 16
Constraint-Based Sequential Pattern Mining with Decision Diagrams
Hosseininasab, A., van Hoeve, W., & Ciré, A. A. (2019) · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · doi:10.1609/aaai.v33i01.33011495 · Cited by 15
Sequential Pattern Mining: A Survey on Approaches
Boghey, R. K., & Singh, S. N. (2013) · International Conference on Communication Systems and Network Technologies · doi:10.1109/csnt.2013.142 · Cited by 14
A short survey on bloom filter and its variants
Gupta, D., & Batra, S. (2017) · International Conference on Computing, Communication and Automation · doi:10.1109/ccaa.2017.8229957 · Cited by 13
A survey of practical algorithms for suffix tree construction in external memory
Barsky, M., Stege, U., & Thomo, A. (2010) · Software Practice and Experience · doi:10.1002/spe.960 · Cited by 13
A survey on mining and analysis of uncertain graphs
Banerjee, S. (2022) · Knowledge and Information Systems · doi:10.1007/s10115-022-01681-w · Cited by 12
Tian, M., Zhang, Y., Zhang, Y., Xiao, X., & Wen, W. (2024) · Cybersecurity · doi:10.1186/s42400-024-00213-z · Cited by 11
PathLAD+: Towards effective exact methods for subgraph isomorphism problem
Wang, Y., Jin, C., & Cai, S. (2024) · Artificial Intelligence · doi:10.1016/j.artint.2024.104219 · Cited by 11
Condensed representations of changes in dynamic graphs through emerging subgraph mining
Impedovo, A., Loglisci, C. A. A. M. D., Ceci, M., & Malerba, D. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103830 · Cited by 10
Hsiao, W.-T., Kan, Y., Kuo, C., Kuo, Y., Chai, S.-K. D., & Lin, H.-C. (2022) · Sensors · doi:10.3390/s22020689 · Cited by 10
Incremental high average-utility itemset mining: survey and challenges
Chen, J., Yang, S., Ding, W., Li, P., Liu, A., Zhang, H., & Li, T. (2024) · Scientific Reports · doi:10.1038/s41598-024-60279-0 · Cited by 10
Improved Compressed String Dictionaries
Brisaboa, N. R., Cerdeira-Pena, A., de Bernardo, G., & Navarro, G. (2019) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3357384.3357972 · Cited by 8
Sequential Pattern Mining: A Proposed Approach for Intrusion Detection Systems
Lefoane, M., Ghafir, I., Kabir, S., & Awan, I. U. (2023) · International Conference on Future Networks and Distributed Systems (ICFNDS) · doi:10.1145/3644713.3644803 · Cited by 7
Below the Surface: Summarizing Event Sequences with Generalized Sequential Patterns
Cüppers, J., & Vreeken, J. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599264 · Cited by 3
Tackling Challenges in Implementing Large-Scale Graph Databases
Arroyuelo, D., Hogan, A., Navarro, G., Reutter, J. L., & Vrgoč, D. (2024) · Communications of the ACM · doi:10.1145/3653314 · Cited by 3
Mining of high utility itemsets from incremental datasets: a survey
Kumar, R., & Singh, K. (2025) · The Knowledge Engineering Review · doi:10.1017/s0269888925000013 · Cited by 3
Inverted Index Automata Frequent Itemset Mining for Large Dataset Frequent Itemset Mining
Dai, X., Hamed, H. N. A., Su, Q., & Xue, H. (2024) · IEEE Access · doi:10.1109/access.2024.3521285 · Cited by 2
Exploring the trie of rules: a fast data structure for the representation of association rules
Kudriavtsev, M., Ngo, V. M., Roantree, M., Bezbradica, M., & McCarren, A. L. (2024) · Journal of Intelligent Information Systems · doi:10.1007/s10844-024-00899-0 · Cited by 1
Evaluating Performance Trade-offs of Caching Strategies for AI-Powered Querying Systems
Oh, H.-J., Zhang, W., Rickett, C. D., Sukumar, S. R., & Byna, S. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10825819 · Cited by 1
Chen, Z., Li, J., Jagadish, H. V., & Riedewald, M. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3750601.3750669 · Cited by 1
Research works printed but not linked: 12
- Christian, M.A., Nathanael, N., Mauliani, A., Indrawati, A., Manik, L.P., and Akbar, Z. (2011, January 5–6). 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’21.
- Boulicaut, J.F., De Raedt, L., and Mannila, H. (2004, January 11–13). A Survey on Condensed Representations for Frequent Sets. Proceedings of the Constraint-Based Mining and Inductive Databases, Hinterzarten, Germany.
- Han, W.S., Lee, J., and Lee, J.H. (2013, January 22–27). 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’13.
- 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.
- Hosseininasab, 2024, Memory-efficient sequential pattern mining with hybrid tries, J. Mach. Learn. Res., 25, 227
- Chen, D., Lai, C., Hu, W., Chen, W., Zhang, Y., and Zheng, W. (2006, January 25–29). Tree partition based parallel frequent pattern mining on shared memory systems. Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium, Rhodes Island, Greece.
- Trotman, A. (2014, January 27–28). Compression, SIMD, and Postings Lists. Proceedings of the 19th Australasian Document Computing Symposium, Melbourne, VIC, Australia. ADCS’14.
- Pratima, 2023, Comprehensive Analysis and Comparative Evaluation of Bitmap Indexing Methods for Efficient Data Management, Int. J. Intell. Syst. Appl. Eng., 11, 563
- 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.
- Guo, S., and Gao, H. (2017, January 2–4). 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.
- Cahill, M.J., Röhm, U., and Fekete, A.D. (2008, January 9–12). Serializable Snapshot Isolation in PostgreSQL. Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, BC, Canada.
- Thankachan, S.V., Patil, M., Shah, R., and Biswas, S. (2016, January 15–18). Probabilistic Threshold Indexing for Uncertain Strings. Proceedings of the 19th International Conference on Extending Database Technology (EDBT), Bordeaux, France.
Cited by
Prioritizing interoperable AI-driven solutions for sustainable circular economy in the public sector
Alshibani, S. M., Singhal, A. B., Gupta, B., Papa, A., & Giudice, M. D. (2026) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2025.124513 · Cited by 11
Yang, C., & Kim, M. (2026) · Applied Sciences · doi:10.3390/app16073391
A Survey of Data Storage, Retrieval, and Optimization Methods in Modern Databases
Upadhyay, D. N. (2026) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-35242
Logical Scalability in Big Data Architectures: Impact of Data Modeling on the Database Layer
Napoli, R. M. A., Gambito, M. A., Celesti, A., & Fazio, M. C. (2026) · IEEE International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW) · doi:10.1109/ccgridw69005.2026.00023
Metadata
- Authors
- Koukaras, P., & Tjortjis, C.
- Affiliations
- International Hellenic University (GR)
- Corresponding author
- Tjortjis, Christos
- Venue
- Big Data and Cognitive Computing
- Publisher
- MDPI AG
- Published
- 2025-10-13
- Volume
- 9
- Issue
- 10
- Pages
- 258
- ISSN
- 2504-2289 (ISSN-L)
- OpenAlex
- W4415138927
- Cited by
- 3
- References
- 88
- Citations by year
- 2026: 3
- FWCI
- 3.15
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Big Data and Cognitive Computing (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- pattern retrieval, pattern repository, index structures, prefix tree, hash-based indexing, bitmap indexing, query optimization, caching, frequent itemsets, association rule mining, sequences, subgraph retrieval, metadata annotation, scalability, benchmarking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.