Cycle detection in critical path networks

Karayiannis, Andreas; Loizou, G.

doi:10.1016/0020-0190(78)90031-5

Cited by 7 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…/* using "employee its involved" Also in the case of recursive queries (for example, finding the shortest path (over arcs) between two points (nodes) in a network (graph)) it is essential that data structure is respected. Earlier solutions for recursive problems such as transitive closure (Aho, Hopcroft, & Ullman, 1974;Bailey, 1999;Connolly, Begg, & Strachan, 1995;Dar & Ramakrishnan, 1994;Suciu & Paredaens, 1994;Ullman & Widom, 1997) often create successor lists much larger than the original data set, which leads to time-consuming duplicate elimination and cycle detection (Karayiannis & Loizou, 1978). Moreover, these solutions are specified in languages that are difficult to understand by end users.…”

Section: Relationship Between Data Structure and Data Manipulationmentioning

confidence: 99%

Improving Data Quality Control in the Xplain-DBMS

Bakker

2012

Data Sci. J.

View full text Add to dashboard Cite

This paper discusses the usability of convertibility, a principle for data quality used by the Xplain-DBMS. Convertibility (uniqueness) of type definitions is a helpful criterion for database design, whereas convertibility of instances is a criterion for the uniqueness of instances (records). However, in many situations with or without generalization/specialization, convertibility appears to be an insufficient criterion for correctness of instances, which is illustrated by many examples. In order to be able to specify more rigorous rules for correctness of instances we propose to use new concepts such as 'identifying property'. These new concepts also facilitate the transformation of relational databases into Xplain databases.

show abstract

Section: Relationship Between Data Structure and Data Manipulationmentioning

confidence: 99%

Improving Data Quality Control in the Xplain-DBMS

Bakker

2012

Data Sci. J.

View full text Add to dashboard Cite

show abstract

“…However, the problems they deal with are different from ours. Papers [4], [8] and in some sense [2] as well, are oriented on finding cycles, whereas [1] deals with the reduction of cyclic graphs and [5] is limited to "start-after-end" graphs and their transformation to acyclic ones.…”

Section: Cycles Of Activitiesmentioning

confidence: 99%

“…The empty cell represents non-conflicting pairs from the set (S´S) -C, e.g., s 4 Tab. 1 Clearing times for the junction in Fig.…”

Section: Fig 4 Example Of a Road Junctionmentioning

confidence: 99%