Self-sorting Algorithm of Primary and Secondary Keyword Based on Treemap for Two-dimensional Uncertain Length Data

Abstract

The present invention discloses a TreeMap based primary and secondary keyword self-sorting algorithm of two-dimensional uncertain-length data. The algorithm comprises: selecting a separator that can distinguish a primary keyword from a secondary keyword from a separator set; by means of a <primary keyword, secondary keyword> pair of the two-dimensional uncertain-length data (a data type of the primary and secondary keywords can be a integral type or a character string type) and data corresponding to the <primary keyword, secondary keyword> pair, separately constructing a Key and a Value of a TreeMap; and inserting the two-dimensional uncertain-length data into a TreeMap buffer area by means of the separator, the Key and the Value. The algorithm provided by the present invention can be applied to data association, data online acquisition / collection, analysis of data (such as a sum and an average value) according to the primary keyword and the like in a Reduce stage in a MapReduce technology, and fulfills the aim of carrying out sorting according to the primary and secondary keywords requirements by inserting the two-dimensional uncertain-length data into the TreeMap buffer area.

Description

technical field [0001] The invention relates to a data processing method, in particular to a self-sorting algorithm of primary and secondary keywords based on TreeMap-based two-dimensional uncertain length data. Background technique [0002] In this patent, two-dimensional data with uncertain length refers to data with a fixed dimension but an uncertain length. Its dimension is two-dimensional: it is represented by a primary keyword and a secondary keyword. String; access two-dimensional data with uncertain length through <primary key, secondary key> pair. The sorting requirement for two-dimensional data with uncertain length is: sort by the primary key first, and then sort by the secondary key when the primary key is the same. [0003] Sorting is the operation of adjusting a set of unordered data (records) into ordered (ascending or descending) data. Existing sorting methods include traditional sorting algorithms, spreadsheet sorting in office automation, and MapRed...

AI Technical Summary

Problems solved by technology

The two-dimensional data with uncertain length is sorted by primary and secondary keywords, because the data length is uncertain, the index type is uncertain (it can be a string type or an integer), and it is sorted by primary and secondary keywords (not the data itself). Therefore Traditional sorting algorithms are not suitable for primary and secondary key sorting of two-dimensional uncertain length data

The operating condition in the Map stage is the data source (direct / indirect file) that must be determined. Two-dimensional data with an uncertain length cannot generate a certain data source. MapReduce sorting is not suitable for primary and secondary key sorting of two-dimensional data with an uncertain length.

Images