DocumentCode
2766069
Title
A comparison of transitive closure algorithms for use in intelligent database systems
Author
Grant, Kevin ; Abdelguerfi, Mahdi ; Dennis, Manuel ; Thomas, Bushrod ; Patterson, Wayne
Author_Institution
Dept. of Comput. Sci., New Orleans Univ., LA, USA
Volume
2
fYear
1994
fDate
3-5 Aug 1994
Firstpage
1366
Abstract
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
Keywords
deductive databases; knowledge based systems; query processing; I/O bottleneck; intelligent database systems; real-life settings; recursive database queries; run-time performance; transitive closure algorithms; Computer science; Database systems; Databases; Deductive databases; Runtime;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1994., Proceedings of the 37th Midwest Symposium on
Conference_Location
Lafayette, LA
Print_ISBN
0-7803-2428-5
Type
conf
DOI
10.1109/MWSCAS.1994.519062
Filename
519062
Link To Document