The application provides a
mass data Top-kskyline group query method, including stage one, applying a
verification theorem of G-
skyline to scan data points in a pre-sequencing table in sequence until all data points are scanned, and a candidate
point set containing all candidate points and child sets of
skyline points is obtained; stage two, candidate groups are generated from the candidate
point set, and judgment of enumeration rounds is completed by a left part theorem, a right part theorem and an approximate theorem; scores of the candidate groups are calculated, and a Top-k
score threshold is maintained; child G-
skyline groups of Top-k candidate groups are generated, and a final result is obtained by updating the Top-k candidate groups. The pre-sequencing table is used as an index structure, and only once construction can be applied to all attribute combination scenes. Early termination is realized by using pre-sequencing, and the data scale that needs to be scanned for screening candidate points is reduced. Based on three calculation theorems of the left part theorem, the right part theorem and the approximate theorem, an efficient calculation method is provided, the upper bound of G-skyline group scores is reduced, and the number of generated G-skyline groups and the calculation amount are greatly reduced.