terminology q. regarding FK

I'm doing some FK analysis of our tables by making a directed
graph representing FK dependencies and then traversing the
graph. In my code, I name everything using directed graph
terminology, but I'd like to have something a bit more
"user friendly" in the report.

In this scenario:
create table t1(a varchar2(20));
alter table t1 add constraint t1_fk foreign key(a) references t2(b);

t1.a must exist in t2.b. So,

t1 is the _______ of t2.
t2 is the _______ of t1.

Many TIA!
Mark

--
Mark Harrison
Pixar Animation Studios
.

Relevant Pages

  • tl.eggdeps 0.2.1
    ... The eggdeps tool reports dependencies between eggs in the working set. ... Dependencies are considered recursively, creating a directed graph. ... Nodes correspond exactly to the distributions in the working set. ...
    (comp.lang.python.announce)
  • Re: Misleading experiments results
    ... I am analysing algorithm performance, ... will hide small dependencies under. ... each vertex having one outer edge) to random mapping. ... create random mapping graph, and graph for my algorithm and checks ...
    (sci.stat.edu)
  • gnome package dependency graph
    ... I recall once seeing a graph of the dependencies between GNOME ... or GTK libraries, but didn't find it this time. ...
    (GNOME)
  • Function-call graph
    ... Does anybody knows about a tool or anything that mirrors, exposes, ... represents someway, etc., the function call dependencies of a module ... in, say, a graph or even textually? ... dynamic(the real dependencies at run-time). ...
    (borland.public.delphi.non-technical)
  • Re: reason for having separate package.lisp?
    ... Or you may have a graph of dependencies ... between the packages that is not a D.A.G, ... Well then the reason why you'd still want to put the defpackages in ...
    (comp.lang.lisp)
Loading