The strong partial transitive-closure problem: algorithms and performance evaluation

The development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 8; H. 4; S. 617 - 629
Hauptverfasser:	Toroslu, I.H., Qadah, G.Z.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.08.1996 IEEE Computer Society
Schlagworte:	Applied sciences Computational modeling Computer science; control theory; systems Context modeling Costs Database systems Deductive databases Exact sciences and technology Information systems. Data bases Logic Memory organisation. Data processing Software Tree graphs Performance evaluation Transitive closure Tree(graph) Deductive database Database query Database Recursive method Data processing Fast algorithm Search algorithm
ISSN:	1041-4347
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!