The Branching Data Model, the Foundation for Automated Tree Visualization

Abstract

The paper presents the newly discovered Branching Data Model; it is a building block for the tree structure. This arrangement of data originates in the relational table by formalizing the so-called parent-child data relations located between two attributes. A well-defined SQL SELECT statement, motivated by theoretical mathematics, establishes a uniform pattern of data relations in the table that has a tree structure. This query both exposes these data relations as well as models them. Program logic operates on these models to enable tree structures to expand and grow computationally. Labels on the nodes of these trees allow end-users to visualize the table's data content. An early form of artificial intelligence (AI) generalizes this data relationship beyond the database table. It uses brute force to verify that another type of Branching Data Model exists between the tables in a database system. The former type of data model is a conceptual model; it organizes the data contained in a database table into menu data for an end-user navigation interface. The latter is a linkage model that connects tables throughout the database system. Together, these two types of Branching Data Models enable program logic to generate database applications entirely by automation. This end-user applications are data-driven. They allow end-users to locate information in a database by visualizing its data content.