Paper Info
Title
Computable queries for relational data bases
Abstract
The concept of “reasonable” queries on relational data bases is investigated. We provide an abstract characterization of the class of queries which are computable, and define the completeness of a query language as the property of being precisely powerful enough to express the queries in this class. This definition is then compared with other proposals for measuring the power of query languages. Our main result is the completeness of a simple programming language which can be thought of as consisting of the relational algebra augmented with the power of iteration.
Year
DOI
Venue
1980
10.1016/0022-0000(80)90032-X
Journal of Computer and System Sciences
Keywords
Field
DocType
relational data
Codd's theorem,SQL,Query language,Relational calculus,Conjunctive query,Relational database,Theoretical computer science,Relational algebra,Domain relational calculus,Mathematics
Journal
Volume
Issue
ISSN
21
2
0022-0000
Citations 
PageRank 
References 
284
122.41
86
Authors
2
Search Limit
100284
Name
Order
Citations
PageRank
Ashok K. Chandra131161215.02
David Harel297031953.76