Re: Newbie DBase architecture questions
Date: 31 May 2002 14:51:10 -0700
jraustin1_at_hotmail.com (James) wrote in message news:<a6e74506.0205310845.3e1ca78f_at_posting.google.com>...
> > Hierarchy wouldn't cut it.
> Why wouldn't heirarchy cut it?
> Complexity in implementing?
> Performance considerations?
> Or just not logical?
Directed Acyclic Graph is more general category than Hierarchy (aka Tree). Products in a store are often belong to more than one category -- it means that the node can have more than one parent.
> > General DAG and Materialized Transitive Closure solves the problem.
> Could you give a simplified example of this methodology?
"Implementing Transitive Closure in SQL" by Libkin&... is classic paper. Received on Fri May 31 2002 - 23:51:10 CEST