{'fraction_non_alphanumeric': 0.026737967914438502, 'fraction_numerical': 0.001336898395721925, 'mean_word_length': 4.992, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An External Memory Algorithm of Maxima-Finding Problems

Maxima-finding problems are the fundamental problem in computational geometry with a great deal of application in many areas, and it has resurfaced with the advent of Skyline Queries for relational databases and data mining recently. The existed algorithms in the field of Maxima-finding problem (Skyline Queries) have been summarized in this paper. But for the massive data sets, there has no I/O linear algorithm yet. A new kind of External Memory Algorithm of Maxima-finding problem (EMMF) has been presented, the I/O complexity of algorithm is linear, the corresponding reliability has been validated from experiments, and the status of 2-dimensional space has been proved in theory too.