Novel database structure data screening and combining method
A technology of data screening and library structure, applied in the field of data processing, can solve the problems of low data import and export efficiency, and achieve the effect of improving speed and saving storage space
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0062] A new type of database structure data screening and merging method to build a "vertical structure database", using the latest vertical storage technology. The vertical structure database will be used as the shared database of the business department. Analysts only need to conceive relevant ideas and select the keywords they need on the "vertical structure database" to summarize relevant data. If you suddenly find that some fields are omitted or some fields are not needed, you only need to re-check the relevant fields. Due to the high efficiency of the vertical storage database, the process of re-selecting fields for processing is very fast, and the required data or list can be re-output in a very short time.
[0063] Step 1. Establish a mapping vertical table of at least one keyword and at least one classification identifier.
[0064] Obtain at least one keyword and at least one category identifier, and establish a mapping vertical table according to the rule that one ...
Embodiment 2
[0076] A new type of database structure data screening and merging method to build a "vertical structure database", using the latest vertical storage technology. The vertical structure database will be used as the shared database of the business department. Analysts only need to conceive relevant ideas and select the keywords they need on the "vertical structure database" to summarize relevant data. If you suddenly find that some fields are omitted or some fields are not needed, you only need to re-check the relevant fields. Due to the high efficiency of the vertical storage database, the process of re-selecting fields for processing is very fast, and the required data or list can be re-output in a very short time. The data screening and merging methods of the vertical structure database include:
[0077] S1: Use the storage format to store the first-level value corresponding to the first-level classification identifier;
[0078] S2: Subdivide the data in each category ident...
Embodiment 3
[0098] A novel method for filtering and merging library structure data, the hash index method in the vertical structure database also includes a multi-hash mapping index method, including:
[0099] 1) The first layer of hash mapping is done on the vertical structure database, and all written data is assigned to a specific hash bucket after being mapped by the first layer of hash function through the classification identifier;
[0100] 2) Build a B+ tree on the value space of the first-level hash. The original linear search time complexity is O(n), and it is optimized to tree search. The tree search time complexity is O(log n), and the hash map is optimized value search;
[0101]3) Hash-mapping the first-level hash buckets again through the second-level hash function, that is, re-dividing the first-level hash buckets to reduce the data capacity in the hash buckets;
[0102] 4) Pointer connections are established between two adjacent layers of hash buckets. The next layer of ha...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
