{'fraction_non_alphanumeric': 0.023547880690737835, 'fraction_numerical': 0.0, 'mean_word_length': 5.134615384615385, '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 equivalences of database schemes

One of the fundamental questions in relation theory is the issue of equivalence between two database schemes. In [BMSU] two such schemes were defined to be equivalent when they have the same set of fixed points under the project-join maps associated with the two schemes. This definition requires in an explicit manner the existence of common universal relations, namely the joins, through which the two schemes exchange information, and the resulting “fiipoint” equivalence is a strong one: Both database schemes are in one-to-one correspondence with the subfamily of universal relations, the joins.