Abstract
This paper presents how transitive closures and their instantiations for all possible types of db interesting functions and function products are computed by the MatBase Datalog¬ subsystem. Moreover, it is proved that the correspond- ing algorithms are linear, solid, complete, and optimal.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
