Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A framework for choosing a database query language
ACM Computing Surveys (CSUR)
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Binding performance at language design time
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Hypothetical datalog negation and linear recursion
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inductive pebble games and the expressive power of datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Workflow, transactions and datalog
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Explicit control of logic programs through rule algebra
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity and axiomatizability of consistent database states
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Horn clauses and the fixpoint query hierarchy
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Δ: Set-theoretic query language capturing LOGSPACE
Annals of Mathematics and Artificial Intelligence
Linear time and the power of one first-order universal quantifier
Information and Computation
Fixed-point semantics and the representation of algorithms on large data
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Partial Fixed-Point Logic on Infinite Structures
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Uniform definability on finite structures with successor
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Languages which capture complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Many Facets of Complexity in Logic
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
One Useful Logic That Defines Its Own Truth
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Terminological cycles in KL-ONE-based knowledge representation languages
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
PBINT, a logic for modelling search problems involving arithmetic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
From polynomial time queries to graph structure theory
Communications of the ACM
Fields of logic and computation
Existential fixed-point logic, universal quantifiers, and topoi
Fields of logic and computation
Decidability and undecidability results for propositional schemata
Journal of Artificial Intelligence Research
Closure properties of weak systems of bounded arithmetic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Complexity of the satisfiability problem for a class of propositional schemata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Languages recognizable by quantum finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Experimental descriptive complexity
Logic and Program Semantics
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
| Hi-index | 0.02 |
Query languages for relational databases have received considerable attention. In 1972 Codd [Cod72] showed that two natural mathematical languages for queries-&-mdash;one algebraic and the other a version of first order predicate calculus-&-mdash;had identical powers of expressibility. Query languages which are as expressive as Codd's Relational Calculus are sometimes called complete. This term is misleading, however, because many interesting queries are not expressible in -&-ldquo;complete-&-rdquo; languages. In this paper we show: Theorem 2: The Fixpoint Hierarchy collapses at the first fixpoint level. That is, any query expressible with several applications of least fixpoint can already be expressed with one. We also show: Theorem 1: Let L be a query language consisting of relational calculus plus the least fixpoint operator. Suppose that L contains a relation symbol for a total ordering relation on the domain (e.g. lexicographic ordering). Then the queries expressible in L are exactly the queries computable in polynomial time. Theorem 1 was discovered independantly by M. Vardi [Var82]. It gives a simple syntactic categorization of those queries which can be answered in polynomial time. Of course queries requiring polynomial time in the size of the database are usually prohibitatively expensive. We also consider weaker languages for expressing less complex queries.