Method and system for greatly compressing volume of database, terminal equipment and readable storage medium
A database and volume technology, applied in other database retrieval, other database indexing, special data processing applications, etc., can solve the problems of inability to balance between database volume and read and write performance, discount of overall database efficiency, and high database space occupation. Ease of development, realization and large-scale production, low R&D and production costs, and simple methods
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0040] Example 1 is a very deep tree structure, and the record is similar to the following structure:
[0041] Aaa / Bbb / Ccc=5
[0042] Aaa / Bbb / Ccc / Ddd / Eee=1
[0043] Aaa / Bbb / Ccc / Ddd / Eee / Fff=string
[0044] …
[0045] If the fields such as Aaa and Bbb are relatively long English words, try to process the fields such as Aaa and Bbb as follows:
[0046] 1. Scan the original data and extract all the fields of node names such as Aaa and Bbb;
[0047] 2. Sort according to the word frequency of each node name from high to low;
[0048] 3. After sorting, encode. For example: Aaa is the highest frequency, followed by Bbb, and so on, as shown in Table 1:
[0049]
[0050]
[0051] Table 1 word frequency sorting code table 1
[0052] 4. Construct the optimal tree through the word frequency sorting code table, and create the optimal tree structure table, as shown in Table 2:
[0053] node field value 0 / 1 / 2 5 0 / 1 / 2 / 3 / 4 1 0 / 1 / 2 / 3 / 4 / 5 string … … ...
Embodiment 2
[0056] Embodiment 2 is data in a kind of xml format, as follows:
[0057]
[0058] 1. Scan the original data and extract all the fields of node names such as FAP and PerfMgmt;
[0059] 2. Sort according to the word frequency of each node name from high to low;
[0060] 3. After sorting, perform coding. When the frequency of node names is the same, just set a different code for each node name. The order of sorting does not affect the construction of the optimal tree. For example: FAP is the highest frequency, followed by PerfMgmt, Config, ConfigNumberOfEntity..., and so on, as shown in Table 3:
[0061] node name coding FAP 0 PerMgmt 1 Config 2 ConfigNumberOfEntity 3 … …
[0062] Table 3 Word frequency ranking code table 2
[0063] 4. Construct the optimal tree through the word frequency sorting code table, and create the optimal tree structure table, as shown in Table 4:
[0064] node field value 0 / 1 / 3 1 ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com