{'fraction_non_alphanumeric': 0.012091898428053204, 'fraction_numerical': 0.0, 'mean_word_length': 5.624, '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 very easy hierarchical DBMS implementation

The implementation of a DBMS offering a hierarchical view is described. The implementation follows a unique architecture designed to simplify DBMS implementation. The architecture incorporates basic physical storage constructs for specifying actual data storage structure, and primitive physical navigation operations for the purpose of implementing data manipulation commands. A brief discussion of the overall architecture, the physical storage language, and the physical navigation language are included here. However, the purpose of this paper is to present the physical storage scheme used within our DBMS and to explain the manner in which our hierarchical data manipulation commands are implemented. Our goal is to make apparent the ease with which our DBMS was implemented.