The Internal Database Update Algorithm

Given an explicit representation of the foreign key dependency graph, check the sizes of all monadic tables prior to non-trivial queries, mark the dependency nodes of enlarged tables as changed, and, for the dependency graph branch rooted at that table indicated via the read request, use post-order traversal of that graph to order the queries of marked nodes to ensure that foreign key dependencies are satisfied.

Bill Pippin 2010-01-14