A Method for Compressed Storage and Retrieval of Triplet Data Based on Cuckoo Hashing

This paper proposes a method for compressing and retrieving triple data based on optimized cuckoo hash. Firstly, the optimized cuckoo hash algorithm is utilized to quickly establish node indexes. Then, the relationship information of triples is stored in the form of a sparse matrix according to the relationship type. Finally, the double compression algorithm k²-Rel is employed to compress the relationship attribute matrix of stored triple information, aiming to reduce storage space and lower storage costs. Experimental results demonstrate that the optimized cuckoo hash algorithm significantly reduces the time for building node indexes. Furthermore, utilizing the k2-Rel compression algorithm for compressing the relationship information between nodes substantially decreases storage space, ultimately achieving efficient storage and retrieval of triple data.