Abstract
An extended version of the SIMD (single-instruction, multiple-data) relational algebraic processor is presented. In addition to the usual relational and set operations the machine has the ability to recycle its responder sets internally. This allows it to perform repeated joins, for example, without external intervention and so achieve operations such as path discovery and transitive closure in graphs stored as relations and to evaluate various types of recursive query. The many compiled methods for recursive query evaluation are applicable in this system, as in any other relational database, and can be efficiently evaluated because of the in-built recursive and iterative capability of the machine. The magic functions approach has a clear connection with the machine, since it uses relations as magic functions. >
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.
