{'fraction_non_alphanumeric': 0.012195121951219513, 'fraction_numerical': 0.0, 'mean_word_length': 4.959677419354839, '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}}
On Aggregation and Computation on Domain Values

Query languages often allow a limited amount of anthmetic and string operations on domain values, and sometimes sets of values can be dealt with through aggregation and sometimes even set comparisons. We address the question of how these facilities can be added to a relational language in a natural way. Our discussions lead us to reconsider the definition of the standard operators, and we introduce a new way of thinking about relational algebra computations. We define a language FC, which has an iteration mechanism as its basis. A tuple language is used to carry out almost all computations. We prove equivalence results relating FC to relational algebra under various circumstances.