By Topic

A transitive closure and magic functions machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Robinson ; Dept. of Comput. Sci., Essex Univ., Colchester, UK ; S. Lavington

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

Published in:

Databases in Parallel and Distributed Systems, 1990, Proceedings. Second International Symposium on

Date of Conference:

2-4 Jul 1990