Relational queries computable in polynomial time
Information and Control
Average case complete problems
SIAM Journal on Computing
The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Skolem normal forms concerning the least fixpoint
Computation theory and logic
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM SIGACT News
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The expressive power of stratified logic programs
Information and Computation
Fundamental properties of deterministic and nondeterministic extensions of Datalog
Selected papers of the workshop on Deductive database theory
Journal of Computer and System Sciences
Finite-model theory—a personal perspective
ICDT '90 Proceedings of the third international conference on database theory on Database theory
On the expected size of recursive Datalog queries
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Analysis and application of adaptive sampling
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Analysis and application of adaptive sampling
Journal of Computer and System Sciences - Special issue on PODS 2000
Convergence law for random graphs with specified degree sequence
ACM Transactions on Computational Logic (TOCL)
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Highly expressive query languages for unordered data trees
Proceedings of the 15th International Conference on Database Theory
| Hi-index | 0.00 |
The optimization of a large class of queries is explored, using a powerful normal form recently proven. The queries include the fixpoint and while queries, and an extension of while with arithmetic. The optimization method is evaluated using a probabilistic analysis. In particular, the average complexity of fixpoint and while is considered and some surprising results are obtained. They suggest that the worst-case complexity is sometimes overly pessimistic for such queries, whose average complexity is often much more reasonable than the provably rare worst case. Some computational properties of queries are also investigated. A probabilistic notion of boundedness is defined, and it is shown that all programs in the class considered are bounded almost everywhere. An effective way of using this fact is provided.