{'fraction_non_alphanumeric': 0.025358324145534728, 'fraction_numerical': 0.0, 'mean_word_length': 4.858064516129033, '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}}
Concurrency control program generation by decreasing nodes of program trees in genetic programming

This paper tries to generate an appropriate concurrency control program by using genetic programming (GP). In GP, a program is represented with a tree. Nodes of a tree are selected from a symbol set. This paper tries two symbol sets: the high-level symbol set and the reduced one. The high-level one includes high-level symbols created by combining conventional ones. In the reduced symbol set, symbols are drastically decreased by changing the method of implementing the concurrency control program. Automatic defined functions (ADFs) are also used. Introducing high-level symbols caused the increase of the number of symbols. This made the program generation difficult. On the other hand, an appropriate program could be generated with the reduced symbol set. An ADF is also used in the program generated.