J.H. ter Bekke and J.A. Bakker (The Netherlands)
: critical path, reachability, recursion,
query language, transitive closure, expressive power.
This paper presents new effective solutions for critical
path applications for directed acyclic graphs. We demon
strate that it is possible to solve these recursive problems
using a data model without nested structures and a
content-driven query language without explicit recursion,
iteration, nesting or navigation. These solutions do not
require the specification of unique start or finish nodes of
the acyclic graph, which is important when data about arcs
and nodes come from external sources, as might be the
case in open Internet applications. The solutions do not
require routing and graph depth specifications. This
content-driven character of the solutions therefore makes
the approach also suitable for end users.