VLDB
1987
ACM
13 years 11 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
A Datalog program can be translated into a system of fixpoint equations of relational algebra; this paper studies how such a system can be solved and optimized for a particular qu...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more cl...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
In thii paper,weconsiderMOBY. a distributedarchitectureto support the developmentof expert databasesystemsin a rule based language.It combinesstandardindexing andhorizontaldatapar...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...