The generalized counting method for recursive logic queries
Proceedings on International conference on database theory
Filtering data flow in deductive databases
Proceedings on International conference on database theory
An Architecture for associative processing of large knowledge bases (LKBs)
The Computer Journal
Minimizing function-free recursive inference rules
Journal of the ACM (JACM)
Compiling general linear recursions by variable connection graph analysis
Computational Intelligence
Special function unit for statistical aggregation functions
Database Machines Sixth International Workshop, IWDM '89
Transitive closure and the LOGA+-strategy for its efficient evaluation
MFDBS 89 Proceedings of the second symposium on Mathematical fundamentals of database systems
The Processing and Evaluation of Transitive Closure Queries
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
Proceedings of the Third International Conference on Data Engineering
Implementing Logic Programs as a Database System
Proceedings of the Third International Conference on Data Engineering
Moving Selections into Linear Least Fixpoint Queries
Proceedings of the Fourth International Conference on Data Engineering
An Optimization Strategy for Recursive Queries in Logic Databases
Proceedings of the Fourth International Conference on Data Engineering
Proceedings of the Fifth International Conference on Data Engineering
Composition of Database Relations
Proceedings of the Fifth International Conference on Data Engineering
Aggregative Closure: An Extension of Transitive Closure
Proceedings of the Fifth International Conference on Data Engineering
Deductive Database System based on Unit Resolution
Proceedings of the Second International Conference on Data Engineering
Recursive Versus Iterative Schemes for Least Fix Point Computation in Logic Databases
Proceedings of the Third International Conference on Data Engineering
Efficient Recursive Query Processing using Wavefront Methods
Proceedings of the Third International Conference on Data Engineering
Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation
Proceedings of the Third International Conference on Data Engineering
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A Simple Implementation of Warshall's Algorithm on a VLSI Chip
WG '86 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
A Graph-Based Decomposition Approach for Recursive Query Processing
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Transitive Closure Algorithms for Very Large Databases
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
New Strategies for Computing the Transitive Closure of a Database Relation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
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.