Paper Info
Title
Computable queries for relational data bases (Preliminary Report)
Abstract
The concept of a “reasonable” query in a relational data base 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. 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
1979
10.1145/800135.804423
STOC
Keywords
Field
DocType
main result,abstract characterization,simple programming language,relational data base,query language,relational algebra,computable query,preliminary report,relational data,programming language,relation algebra,computational complexity,register allocation
Query optimization,Codd's theorem,Discrete mathematics,Conjunctive query,Query language,Relational calculus,Programming language,Computer science,Sargable,Theoretical computer science,Relational algebra,Domain relational calculus
Conference
Citations 
PageRank 
References 
13
8.30
6
Authors
2
Name
Order
Citations
PageRank
Ashok K. Chandra131161215.02
David Harel297031953.76