## Queries Are Easier Than You Thought (probably) (1992)

Citations: | 11 - 5 self |

### BibTeX

@MISC{Abiteboul92queriesare,

author = {Serge Abiteboul and Kevin Compton and Victor Vianu},

title = {Queries Are Easier Than You Thought (probably)},

year = {1992}

}

### Years of Citing Articles

### OpenURL

### Abstract

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. 1 Introduction The complexity of query languages has traditionally been investigated using worst-case bounds. We argue that this approach provides an overly pessimistic picture o...