We prove several extremal results for hypergraphs with ordered vertex sets. Some of them lead to the growth n.f(alpha(n)) of the extremal function and some to the growth n.(log n)^c.