{'fraction_non_alphanumeric': 0.018944519621109608, 'fraction_numerical': 0.0, 'mean_word_length': 5.379310344827586, '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}}
A Space Efficient Scheme for Persistent Graph Representation

Graph mining is currently the focus of intense research. Major driving factors include social media, opinion mining, and the schemaless noSQL databases. Time evolving or dynamic graphs are the primary data structures in these fields. Often dynamic graphs must support persistency, meaning that from any given graph state past states can be accessed. Within the graph database context, persistency enables rollback capability, whereas in social media several phenomena such as friend deletion can be modeled. A novel, efficient, and persistent data structure based on tries is proposed. Its potential is displayed by added persistency to the deterministic Kronecker graph model.