Data Modeling For Trees

Data Modeling For Trees

Michael Blaha, Modelsoft Consulting

Mathematical trees often arise when constructing data models. A tree is a set of nodes that connect from child to parent. A node can have many child nodes; all nodes have one parent node except for the node at the tree’s top. There are no cycles – that means at most one path connects any two nodes.

In this session we will present different patterns for trees and their trade-offs along with examples of their usage. We will express the patterns using both the UML and IE notations. The UML notation brings out the abstract nature of the patterns; the IE notation illustrates the mechanics. We will also show some common SQL queries that use the patterns.

About the Speaker

Michael Blaha is a consultant, author, and trainer who specializes in conceiving, architecting, modeling, designing, and tuning databases. He has worked with dozens of organizations around the world. Blaha has authored seven U.S. patents, seven books, many articles, and two video courses. He received his doctorate from Washington University in St. Louis and is an alumnus of GE Global Research in Schenectady, New York. You can find out more about him at superdataguy.com.