For graphs, there are many classes that admit FPT-algorithms for model checking of first order logic, e.g. the class of nowhere dense graphs by Grohe et. al.
Are there similar results for ($k$-uniform) hypergraphs, when viewing a hypergraph as as structure equipped with a $k$-ary relation symbol $E$? If so, can you point me to the according literature?