Computable Queries for Relational Databases (1980)
by
Ashok Chandra
,
Asok K. Cadm
,
David Harel
| Citations: | 82 - 0 self |
BibTeX
@MISC{Chandra80computablequeries,
author = {Ashok Chandra and Asok K. Cadm and David Harel},
title = {Computable Queries for Relational Databases},
year = {1980}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper is to settle the question of maximal expressiveness of query languages. This is done in two steps. First, the set of computable queries is defined. These correspond to partial recursive functions which satisfy a consistency criterion reflecting the fact that the computation is on a data base rather than, say, on a natural number
