{'fraction_non_alphanumeric': 0.008583690987124463, 'fraction_numerical': 0.0, 'mean_word_length': 4.737704918032787, '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}}
Representing a Relational Database as a Directed Graph and Some Applications

In this paper we represent the relational database as a directed graph, regarding tables as nodes and foreign keys as edges. We also make several definitions to describe the dependencies between tables. Then algorithms are proposed for identifying all tables dependent upon a certain table and ordering them in a specific way so every table to appear before all tables that depend on it in the sequence. After that we define dependencies between records and represent a set of records also as a graph. In the end several applications of the algorithms are shown as well as practical problems that could be solved by them.