Digital Library XML Metadata Storage based on Data Mining Algorithm

The efficient storage and retrieval of XML metadata in digital libraries face challenges such as space waste, redundancy, and low query performance under massive data volumes. Traditional XML storage methods struggle to balance scalability and efficiency. This study proposes an Apriori algorithm-based optimization framework. XML metadata undergoes preprocessing, followed by frequent itemset mining and association rule generation using Apriori. These rules guide metadata grouping and joint indexing to reduce redundancy and enhance retrieval. Experiments on datasets (10–100 GB) demonstrate significant improvements: optimized storage reduces retrieval times by 42–50% compared to traditional methods. While storage space utilization slightly decreases, the method enhances scalability and flexibility, maintaining stable performance as data grows. The approach effectively addresses storage inefficiencies and accelerates queries in large-scale environments. Limitations include computational overhead for extensive frequent itemsets. Future work will explore integration with deep learning and broader metadata formats.

Authors

Institutions

Publication Details

Published
2025-04-25
DOI
https://doi.org/10.1109/icdcece65353.2025.11034852
Primary Topic
Web Data Mining and Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Digital Library XML Metadata Storage based on Data Mining Algorithm

Zhen Sun
Web Data Mining and Analysis
article

Digital Library XML Metadata Storage based on Data Mining Algorithm

Zhen Sun
article en

Abstract

The efficient storage and retrieval of XML metadata in digital libraries face challenges such as space waste, redundancy, and low query performance under massive data volumes. Traditional XML storage methods struggle to balance scalability and efficiency. This study proposes an Apriori algorithm-based optimization framework. XML metadata undergoes preprocessing, followed by frequent itemset mining and association rule generation using Apriori. These rules guide metadata grouping and joint indexing to reduce redundancy and enhance retrieval. Experiments on datasets (10–100 GB) demonstrate significant improvements: optimized storage reduces retrieval times by 42–50% compared to traditional methods. While storage space utilization slightly decreases, the method enhances scalability and flexibility, maintaining stable performance as data grows. The approach effectively addresses storage inefficiencies and accelerates queries in large-scale environments. Limitations include computational overhead for extensive frequent itemsets. Future work will explore integration with deep learning and broader metadata formats.

Changchun University (CN)
Openalex Percentile: Top 80%
Web Data Mining and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.