A relational model of data for large shared data banks
Communications of the ACM
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
Logic and databases: a response
ACM SIGACT News
Logic and databases: a response
ACM SIGPLAN Notices
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
A Formal System for Reasoning about Programs Accessing a Relational Database
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressive power of query languages for relational databases
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incorporating computed relations in relational databases
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Impacts of logic and databases (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Explicit Versus Symbolic Algorithms for Solving ALFP Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Fields of logic and computation
Standing on the shoulders of a giant: one persons experience of turings impact
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
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.