A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Bounds on the propagation of selection into logic programs
1987
Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '87
We consider the problem of propagating selections into logic programs (i.e., recursive Horn clause programs). In particular, we study the class of chain programs and formalize selection propagation on such a logic program as: the task of finding an equivalent program containing only monadic derived predicates. Selection propagation is always possible for database programs (i.e., tirst-order formula programs) and is often a desirable optimization. We show that the situation is qualitatively
doi:10.1145/28659.28683
dblp:conf/pods/BeeriKBR87
fatcat:ln5lk6ot4zafvdklmjb5s7ooyi