A comparison of transitive closure algorithms for use in intelligent database systems


In this paper we discuss several transitive closure algorithms used to compute the answers to recursive database queries. We also compare the run-time performance of two of these algorithms under various conditions. Particular attention is paid to the problem of the "I/O bottleneck", which is the chief factor in determining the performance of transitive closure algorithms in real-life settings.



Software And Hardware

• Hardware: Processor: i3 ,i5 RAM: 4GB Hard disk: 16 GB • Software: operating System : Windws2000/XP/7/8/10 Anaconda,jupyter,spyder,flask Frontend :-python Backend:- MYSQL