# First-order queries on structures of bounded degree are computable with constant delay

@article{Durand2007FirstorderQO, title={First-order queries on structures of bounded degree are computable with constant delay}, author={Arnaud Durand and E. Grandjean}, journal={ACM Trans. Comput. Log.}, year={2007}, volume={8}, pages={21} }

A relational structure is <i>d</i>-degree-bounded, for some integer <i>d</i>, if each element of the domain belongs to at most <i>d</i> tuples. In this paper, we revisit the complexity of the evaluation problem of not necessarily Boolean first-order (<b>FO</b>) queries over <i>d</i>-degree-bounded structures. Query evaluation is considered here as a dynamical process. We prove that any <b>FO</b> query on <i>d</i>-degree-bounded structures belongs to the complexity class constant-Delay<inf><i… CONTINUE READING

66 Citations

Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion

- Mathematics, Computer Science
- 2017

18

Enumeration of first-order queries on classes of structures with bounded expansion

- Computer Science, Mathematics
- 2013

49

#### References

##### Publications referenced by this paper.

SHOWING 1-6 OF 6 REFERENCES

Graphs properties checkable in linear time in the number

- 2004