Information is often stored in the relational database. This technology is now fifty years old, but there remain patterns of relational data that have not yet been studied. The abstract presents a new data pattern called the branching data model (BDM). It represents the pure alignment of the table’s schema, its data content, and the operations on these two structures. Using a well-defined SELECT statement, an input data condition and its output values form a primitive tree structure. While this relationship is formed outside of the query, the abstract shows how we can view it as a tree structure within the table. Using algorithms, including AI, it goes on to show how this data model connects with others, within the table and between them, to form a new, uniform level of abstraction over the data throughout the database.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited