The Parallel Complexity of Simple Chain Queries

@inproceedings{Afrati1987ThePC,
  title={The Parallel Complexity of Simple Chain Queries},
  author={Foto N. Afrati and Christos H. Papadimitriou},
  booktitle={PODS},
  year={1987}
}
They are written m a notation called DATALOG, that IS, PROLOG without function symbols and other lmpurities (an orthogonal way of vlewmg DATALOG 1s as Relatlonal Calculus with the additional power of recurslon) For more on DATALOG see, for example, [UV] Both queries above define a view S m terms of the database relations a and b We are Interested m the parallel complexJtyof these and similar queries, that is, the degree to which such queries are amenable to rapid parallel evaluation by the… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.