{'fraction_non_alphanumeric': 0.017823639774859287, 'fraction_numerical': 0.0, 'mean_word_length': 4.895027624309392, '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}}
Functional completeness in object-oriented databases

A definition of completeness in the context of Object Oriented Databases (OODBs) is proposed in this paper. It takes into account the existence of various categories of functions in OODBs, each of which must be complete in itself. The functionality of an OODB can be divided into sets of related functions. For example, functions needed to perform all schema evolution operations or all version management operations belong in two distinct sets. Further, each set of functions must include all functions needed to perform all operations defined for that set. Thus, for an OODB to be functionally complete, it must support a certain number of sets (or categories) of functions and each such set must be complete in itself. The purpose of this paper is not to give a precise definition of the categories of functions but rather to define a framework within which such categories should be examined. This paper contains a working definition of functional completeness. We would welcome any feedback on our proposal.