S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, 1995.

G. Bagan, MSO queries on tree decomposable structures are computable with linear delay, Computer Science Logic (CSL'06), 2006.

A. Durand and E. Grandjean, First-order queries on structures of bounded degree are computable with constant delay, ACM Trans. Comput. Log, vol.8, issue.4, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00195016

A. Durand, N. Schweikardt, and L. Segoufin, Enumerating answers to first-order queries over databases of low degree, Symp. on Principles of Database Systems (PODS'14), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01070898

Z. Dvorak, D. Král, and R. Thomas, Testing first-order properties for subclasses of sparse graphs, J. ACM, vol.60, issue.5, p.36, 2013.

M. Frick, Generalized model-checking over locally tree-decomposable classes, Theory Comput. Syst, vol.37, issue.1, pp.157-191, 2004.

M. Frick and M. Grohe, Deciding first-order properties of locally treedecomposable structures, J. ACM, vol.48, issue.6, pp.1184-1206, 2001.

M. Frick and M. Grohe, The complexity of first-order and monadic second-order logic revisited, Ann. Pure Appl. Logic, vol.130, issue.1-3, pp.3-31, 2004.

M. Grohe, S. Kreutzer, and S. Siebertz, Deciding first-order properties of nowhere dense graphs, Symp. on Theory of Computing (STOC), 2014.

K. Mamadou-moustapha, Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques), 2008.

W. Kazana and L. Segoufin, First-order query evaluation on structures of bounded degree, Logical Methods in Computer Science, vol.7, issue.2, 2011.

W. Kazana and L. Segoufin, Enumeration of first-order queries on classes of structures with bounded expansion, Symp. on Principles of Database Systems (PODS), 2013.
URL : https://hal.archives-ouvertes.fr/hal-00908779

W. Kazana and L. Segoufin, Enumeration of monadic second-order queries on trees, ACM Trans. Comput. Log, vol.14, issue.4, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00916400

S. Kreutzer and A. Dawar, Parameterized complexity of first-order logic, Electronic Colloquium on Computational Complexity (ECCC), vol.16, p.131, 2009.

L. Libkin, Elements of Finite Model Theory, 2004.

J. Ne?et?il and P. Ossona-de-mendez, On nowhere dense graphs, Eur. J. Comb, vol.32, issue.4, pp.600-617, 2011.