Abstract
We study the properties of the magic semi-join, a new algebraic operator. In essence, a magic semi-join is the composition of a semi-join and a transitive closure. We present a theory for magic semi-joins that mirrors the theory for semi-joins; in particular, we define equivalence transformations of algebraic formulas using magic semi-joins, and we introduce the notion of full reducer program in this framework. The application of magic semi-joins is in the efficient evaluation of recursive DATALOG queries in centralized and in distributed databases.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
