et al. [1986], Bancilhon and Ramakrishnan [1986], Henschen and Naqvi
[1984],
Sacca and Zaniolo [1986], and Ullman [1985] could be combined
with parallel evaluation algorithms.
12.
Is there an optimal parallel algorithm for the dag-GAP problem? This
theoretical question is well motivated by the large PRAM processor
bounds of Theorem 1.
Parallelism
and
Structured
Data
Term
Unification,
Matching,
and
Equivalence
PROLOG and other logic programming languages, in addition to their recur-
sive control structure exemplified by logical query programs, provide primitive
operations for the definition and manipulation of structured data.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.