Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 90 of the 90 references it cites were found in a registry or an index.

Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures

Open access
Koukaras, Paraskevas, Tjortjis, Christos · 2025 · Big Data and Cognitive Computing

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/bdcc9100258

Cites

90 of 90 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Positioning of this review in the broader pattern-retrieval landscape. The taxonomy groups contributions into data and pattern types (Section 2), indexing structures (Section 3), storage and repositories (Section 4), query optimisation (Section 5), scalability and streaming (Section 6), and systems and integration (Section 7). Elements highlighted in red mark the research emphases synthesised in this review.
Figure 1 Positioning of this review in the broader pattern-retrieval landscape. The taxonomy groups contributions into data and pattern types (Section 2), indexing structures (Section 3), storage and repositories (Section 4), query optimisation (Section 5), scalability and streaming (Section 6), and systems and integration (Section 7). Elements highlighted in red mark the research emphases synthesised in this review.CC-BY · From the PDF
Figure 2 Roadmap for the paper. The main timeline (Sections 1-8) proceeds top down, from introduction and foundations to indexing, storage, query optimisation, scalability, and systems. Dashed red links indicate how definitions from Section 2 (exact/topk /approximate, similarity/fuzzy, semantic querying, and utility/incremental contexts) inform design choices in later sections. Section 8 consolidates the open challenges and future directions.
Figure 2 Roadmap for the paper. The main timeline (Sections 1-8) proceeds top down, from introduction and foundations to indexing, storage, query optimisation, scalability, and systems. Dashed red links indicate how definitions from Section 2 (exact/topk /approximate, similarity/fuzzy, semantic querying, and utility/incremental contexts) inform design choices in later sections. Section 8 consolidates the open challenges and future directions.CC-BY · From the PDF
Figure 3 Taxonomy of structured data types and their typical pattern outputs.
Figure 3 Taxonomy of structured data types and their typical pattern outputs.CC-BY · From the PDF
Figure 4 Conceptual view of retrieval, filtering, and summarisation operations and their typical techniques.
Figure 4 Conceptual view of retrieval, filtering, and summarisation operations and their typical techniques.CC-BY · From the PDF
Figure 5 Taxonomy of query types in pattern retrieval and representative techniques.
Figure 5 Taxonomy of query types in pattern retrieval and representative techniques.CC-BY · From the PDF
Figure 6 Taxonomy of indexing structures for pattern retrieval, showing four main categories (treebased, hash-based, bitmap-based, graph-based) with representative examples and their key properties.
Figure 6 Taxonomy of indexing structures for pattern retrieval, showing four main categories (treebased, hash-based, bitmap-based, graph-based) with representative examples and their key properties.CC-BY · From the PDF
Figure 7 Inverted index: dictionary items point to posting lists; queries resolve by list intersection to return candidate patterns.
Figure 7 Inverted index: dictionary items point to posting lists; queries resolve by list intersection to return candidate patterns.CC-BY · From the PDF
Figure 8 Bloom filter: elements are inserted via multiple hash functions into a bit array. Queries test the same positions; all bits set implies possible presence (false positives possible), while a zero guarantees absence.
Figure 8 Bloom filter: elements are inserted via multiple hash functions into a bit array. Queries test the same positions; all bits set implies possible presence (false positives possible), while a zero guarantees absence.CC-BY · From the PDF
Figure 9 Repository pipeline: mining and ingest feed storage and indexes; the API executes constrained queries and returns ranked results.
Figure 9 Repository pipeline: mining and ingest feed storage and indexes; the API executes constrained queries and returns ranked results.CC-BY · From the PDF
Figure 10 Brute-force scans all patterns; indexed search first prunes to candidates, then evaluates.
Figure 10 Brute-force scans all patterns; indexed search first prunes to candidates, then evaluates.CC-BY · From the PDF
Figure 11 Distributed retrieval: the coordinator fans out the query to nodes and merges partial results.
Figure 11 Distributed retrieval: the coordinator fans out the query to nodes and merges partial results.CC-BY · From the PDF
Figure 12 Semantic cross-domain retrieval pipeline: user queries are mapped via ontologies and embeddings to align lexically distinct terms (e.g., acetaminophen vs. paracetamol), enabling unified retrieval of patterns across heterogeneous domains.
Figure 12 Semantic cross-domain retrieval pipeline: user queries are mapped via ontologies and embeddings to align lexically distinct terms (e.g., acetaminophen vs. paracetamol), enabling unified retrieval of patterns across heterogeneous domains.CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 88 references

Research works printed but not linked: 12

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. Hosseininasab, 2024, Memory-efficient sequential pattern mining with hybrid tries, J. Mach. Learn. Res., 25, 227
  6. 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.
  7. Trotman, A. (2014, January 27–28). Compression, SIMD, and Postings Lists. Proceedings of the 19th Australasian Document Computing Symposium, Melbourne, VIC, Australia. ADCS’14.
  8. Pratima, 2023, Comprehensive Analysis and Comparative Evaluation of Bitmap Indexing Methods for Efficient Data Management, Int. J. Intell. Syst. Appl. Eng., 11, 563
  9. 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.
  10. 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.
  11. 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.
  12. 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

See all 4

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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures. https://app.cochat.ai/papers/10.3390/bdcc9100258
The paper
Koukaras, P., & Tjortjis, C. (2025). Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures. Big Data and Cognitive Computing. https://doi.org/10.3390/bdcc9100258

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.