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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on knowledge and data engineering Vol. 8; no. 4; pp. 617 - 629
Main Authors:	Toroslu, I.H., Qadah, G.Z.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.08.1996 IEEE Computer Society
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!