The Dead Coders Society is an informal, semi-regular meetup for anyone and everyone interested in computer science.
There are several ways to represent hierarchical structures in a flat relational database. One way to do this is using a concept from set theory called transitive closures. This method is fairly easy to understand, very efficient to query and update, and provides referential integrity.
This talk will briefly explain transitive closures, then describe how to store and access a tree using a closure table in an SQL database.
When: 1pm Tuesday 30th September
Venue: Ad Lib, 33 Ingram St Glasgow, G1 1HA.