In visualization, tree structures and databases are fundamental. Yet, our understanding of tree structures derived from databases is held in check by two factors: 1) by the fixed screen size, and 2) by the number of database attributes this screen can display. The paper introduces a
primitive tree structure derived from the database that broadens our perspective on tree structures on the computer by taking an inward direction. The Aleph is an abstract data relation that represents parent/child data relations constructed between the database and the graphic display. By
modeling data relations according to Mark Burgin's theory of named sets, a pure mathematics, the Aleph's uniform patterns took shape and were visible. The Aleph is modeled by a well-formed query that narrows retrieval operations to a pair of table attributes: one is input and the other is
output. This simple expression establishes a new level of abstraction that binds a data condition on an input attribute to output from a single attribute. To instantiate this parent/child relationship, it is necessary that the data condition
Paul Zellweger, "The Aleph Data Relation in Structured Data, A Tree within a Tree Visualization" in Proc. IS&T Int’l. Symp. on Electronic Imaging: Visualization and Data Analysis, 2016, https://doi.org/10.2352/ISSN.2470-1173.2016.1.VDA-499