Paper
26 June 2023 Knowledge atlas storage optimization algorithm based on two-level compression
Author Affiliations +
Abstract
A knowledge graph is a special kind of graph data, which consists of a triad. Each node in the knowledge graph has several attributes and their attribute values. The storage of the knowledge graph has been the object of academic research, and in this paper, we conduct an in-depth study on the knowledge graph data indexing and compression storage algorithm supported by the RDF graph model, and propose an optimization algorithm for the storage query after the second-level compression. The core of this paper is that after the second-level compression of the k2-tree tree, the sub-matrices are prioritized in terms of the size of data blocks, and when retrieving data, they are retrieved according to the priority, so that the blocks in front are both subject and object at the same time, which can improve the efficiency of data reading, so that the parts with more information will be retrieved first, instead of the traditional sequential retrieval, which tends to retrieve the null values or the data with less information.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kai Yuan Yang, Jun Yang, Yu Hua Xu, and Zhi Xin Sun "Knowledge atlas storage optimization algorithm based on two-level compression", Proc. SPIE 12721, Second International Symposium on Computer Applications and Information Systems (ISCAIS 2023), 1272116 (26 June 2023); https://doi.org/10.1117/12.2683402
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Data storage

Mathematical optimization

Data modeling

Matrices

Detection and tracking algorithms

Telecommunications

Back to Top