How to describe such a data structure?

Question

Programming

Abstract:
There is a set of dictionaries, each containing many key-value pairs. Keys must match keys from other dictionaries, but may have different values. Some keys may be in one dictionary, or not in another. The program needs to get values ​​by key and be able to switch between dictionaries. To do this, there is a conditional database that stores links to dictionaries.

When preparing such data, in order not to delve into each dictionary separately and not manually synchronize keys between dictionaries, we have a list of all possible keys from all dictionaries in the database. Having selected a key, we can edit values ​​from different dictionaries, as well as delete keys (from the selected dictionary) and add (to the selected dictionary). And most importantly, to see in which dictionaries the key-value is missing and add it, without having to manually enter the key.

Does such an approach to the data structure have a name, and how correct is it?