New transitive closure algorithm for recursive query processing in deductive databases
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Efficient algorithms for the instantiated transitive closure queriesIEEE Transactions on Software Engineering, 1991
- The input/output complexity of transitive closurePublished by Association for Computing Machinery (ACM) ,1990
- A sensitive transitive closure algorithmInformation Processing Letters, 1981
- On computing the transitive closure of a relationActa Informatica, 1977
- A modification of Warshall's algorithm for the transitive closure of binary relationsCommunications of the ACM, 1975
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A Theorem on Boolean MatricesJournal of the ACM, 1962