{'fraction_non_alphanumeric': 0.02182952182952183, 'fraction_numerical': 0.0, 'mean_word_length': 5.4630872483221475, '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}}
Detection and elimination of redundant inheritance for object-oriented database (OODB)

Class hierarchy, which consists of inheritance relationships, is the main theme of schema design for object-oriented databases and contributes to important features such reusability and incremental design. However, once an object-oriented database schema is inserted or deleted during the lifetime of a database, it is prone to develop redundant inheritance relationships, which suffer from massive data redundancy and inconsistency. To ensure consistency and non-redundancy of the OODB schema after every insertion or deletion, we propose a rapid detection method by mapping a class hierarchy to a transitive closure matrix. A faster algorithm for computing a transitive closure matrix with respect to a class hierarchy is presented to help to detect redundant inheritance. Its time complexity is O(k x n). Also, an algorithm to eliminate redundant inheritance is proposed.