1993 · 20 citations · 6 references
ComputingComputer ScienceMathematicsDatabasesLogicSet TheoryFirst-order LogicQuery ProcessingRecursion TheoryRelational AlgebraRelational Data ModelRelational DatabasesCompletenessCompleteness ResultsP-completenessRecursive QueriesRelational CompletenessRelational Query Languages
this paper, we propose to initiate such research by addressing the problem of capturing the class of computable queries over recursive data bases, the motivation being borrowed from [ CH]
6
Generic Computation and its complexity
Serge Abiteboul, Victor Vianu · 1991 · 193 citations
On the expressive power of the relational algebra
Jan Paredaens · Information Processing Letters · 1978 · 85 citations
Computing, Computer Science, Algebra +11
Taking it to the limit: on infinite variants of NP-complete problems
Tirza Hirst, David Harel · 2002 · 26 citations