A transitive closure and magic functions machine

An extended version of our SIMD Relational Algebraic Processor is presented. In addition to the usual relational and set operations the new 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 our machine. The Magic Functions approach has a clear connection with the machine since it uses relations as magic functions.

[1]  Nelson Mendonça Mattos,et al.  Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation , 1989, MFDBS.

[2]  C. Pandu Rangan,et al.  A Simple Implementation of Warshall's Algorithm on a VLSI Chip , 1986, WG.

[3]  Georges Gardarin,et al.  Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs , 1987, VLDB.

[4]  Hidenori Itoh,et al.  Deductive database system based on unit resolution , 1986, 1986 IEEE Second International Conference on Data Engineering.

[5]  Carlo Zaniolo,et al.  The Generalized Counting Method for Recursive Logic Queries , 1986, Theor. Comput. Sci..

[6]  Z. Meral Özsoyoglu,et al.  Synchronized counting method , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[7]  M. Henning.  Generic associative memory: parallel hardware for large knowledge-based systems , 1989 .

[8]  Carlo Zaniolo,et al.  Magic counting methods , 1987, SIGMOD '87.

[9]  Clement T. Yu,et al.  Efficient recursive query processing using wavefront methods , 1987, 1987 IEEE Third International Conference on Data Engineering.

[10]  Michael Kifer,et al.  Filtering Data Flow in Deductive Databases , 1986, ICDT.

[11]  Rakesh Agrawal.  Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries , 1988, IEEE Trans. Software Eng..

[12]  G. Barbara Demo.  Recursive versus iterative schemes for least fix point computation in logic databases , 1987, 1987 IEEE Third International Conference on Data Engineering.

[13]  Hongjun Lu,et al.  Design and evaluation of algorithms to compute the transitive closure of a database relation , 1987, 1987 IEEE Third International Conference on Data Engineering.

[14]  H. V. Jagadish,et al.  Composition of database relations , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[15]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

[16]  Eljas Soisalon-Soininen,et al.  An optimization strategy for recursive queries in logic databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[17]  Mahdi Abdelguerfi.  Special Function Unit for Statistical Aggregation Functions , 1989, IWDM.

[18]  Eugene Wong,et al.  Transforming Nonlinear Recursion into Linear Recursion , 1988, Expert Database Conf..

[19]  Pradip K. Srimani,et al.  Fast parallel algorithm for all-pairs shortest path problem and its VLSI implementation , 1989 .

[20]  Jerome Robinson,et al.  A High Performance Relational Algebraic Processor for Large Knowledge Bases , 1989 .

[21]  Dietmar Seipel,et al.  A Graph-Based Decomposition Approach for Recursive Query Processing , 1988, WG.

[22]  Simon H. Lavington.  Technical overview of the intelligent file store , 1988, Knowl. Based Syst..

[23]  Theodore S. Norvell,et al.  Aggregative closure: an extension of transitive closure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[24]  Joachim Biskup,et al.  Transitive Closure Algorithms for Very Large Databases , 1988, WG.

[25]  Jiawei Han,et al.  The Processing and Evaluation of Transitive Closure Queries , 1988, EDBT.

[26]  H. V. Jagadish,et al.  Direct Algorithms for Computing the Transitive Closure of Database Relations , 1987, VLDB.

[27]  Michael Kifer,et al.  Implementing logic programs as a database system , 1987, 1987 IEEE Third International Conference on Data Engineering.

[28]  Raghu Ramakrishnan,et al.  Efficient Transitive Closure Algorithms , 1988, VLDB.

[29]  Hongjun Lu,et al.  New Strategies for Computing the Transitive Closure of a Database Relation , 1987, VLDB.

[30]  Jeffrey F. Naughton,et al.  Minimizing function-free recursive inference rules , 1989, JACM.

[31]  M. Henning,et al.  An Architecture for Associative Processing of Large Knowledge Bases (LKBs) , 1987, Comput. J..

[32]  Premkumar T. Devanbu,et al.  Moving selections into linear least fixpoint queries , 1988, Proceedings. Fourth International Conference on Data Engineering.

[33]  JIAWEI HAN,et al.  Compiling general linear recursions by variable connection graph analysis , 1989, Comput. Intell..