Nested PATRICIA Trie Compression for Redundant Edge Strings
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Node-merged tries, such as PATRICIA tries, still exhibit data redundancy, which hampers storage space efficiency, especially when dealing with large datasets without common prefixes.
Innovation Solution
Implement a nesting operation by creating a first PATRICIA trie, collecting and segmenting edges into strings, and then forming a second PATRICIA trie from these strings, along with storing pointers to nodes in the second trie, to create a nested structure that further compresses the data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If node-merged tries (PATRICIA tries) are used for data compression, then the compression ratio is improved, but data redundancy remains and storage space efficiency is hampered
Solution Approach 1:
The patent applies nesting by creating a hierarchical structure where a first PATRICIA trie is built from original strings, then a second PATRICIA trie is constructed from segmented portions of edges in the first trie. This nested arrangement allows redundant data to be stored once in the second trie and referenced multiple times through the first trie structure, significantly reducing overall storage space while maintaining compression effectiveness.
2Loss of substance
If edges in PATRICIA trie are segmented and a second trie is created, then storage efficiency is improved, but device complexity increases
Solution Approach 1:
The patent segments edges in the first PATRICIA trie that contain redundant data into multiple portions. These segmented portions are then used as input to create a second PATRICIA trie. This segmentation allows the redundant data to be extracted and stored efficiently in the second trie, reducing overall data redundancy while the modular structure helps manage the complexity through organized data division.
Data Source
AI summary
According to one aspect of the present application, a method for data compression comprises: creating a first trie for a first set of strings, the first set of strings comprising a plurality of raw data strings, wherein a trie consists of a plurality of nodes linked through parent-child relation, and wherein each edge of the trie is of at least one character and the edge corresponds to a state transition from a parent node of the edge to a child node of the edge; collecting edges of the first trie longer than a predetermined length and making these edges a first subset of strings of the first trie; segmenting a string in the first subset of strings into two or more fragments when the string satisfies a predetermined condition and collecting all segmented fragments and all un-segmented strings in the first subset of strings as a segmented set of strings; and storing the first set of strings using the first trie and the segmented set of strings so as to compress the raw data strings.