The "Database Taxonomy" organizes relational data into a navigation structure that enables end-users to browse and explore database content. The techniques used to build this interface are based on recursion and on models derived from Burgin's mathematical theory of named sets (BNS). These models unify data relations in the relational database in a number of new and innovation ways. First, one model, the binary attribute relations or BAR unifies data relations found between two attributes in a table regardless of whether their mapping is 1:1 or 1 :M. Next, the BAR can serve as a link in a B-Z chain that transforms these data relations into a network structure that provides a framework for compiled menu data files for this interface. And lastly, the B-Z chain itself unifies both keyed and non-keyed attributes within the same model. By integrating these two different types of attributes into the same model, this navigation structure is able to support pathways that flow from one table to another, and that can terminate with a primary key. This novel use of keyed and non-keyed attributes enables end-users to drill down through the taxonomy in a purposeful way to reach a window that displays a cluster of information managed by the database.
展开▼
