Content-driven specifications for recursive project planning applications
J.H. ter Bekke and J.A. Bakker
This paper presents new effective solutions for critical path applications for directed acyclic graphs. We demonstrate 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.
Keywords: critical path, reachability, recursion, query language, transitive closure, expressive power.
Proceedings of the IASTED International Symposia Applied Informatics (AI2002), Innsbruck, Austria, pp. 448-452
Editor: M.H. Hamza
Publisher: IASTED/ACTA Press, Anaheim - Calgary - Zurich
From the personal digital library:
Full paper in pdf-format [28 KB]