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}
}
  • Arnaud Durand, E. Grandjean
  • Published 2007
  • Computer Science, Mathematics
  • ACM Trans. Comput. Log.
  • 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
    First-order query evaluation on structures of bounded degree
    37
    Enumerating answers to first-order queries over databases of low degree
    29
    Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion
    18
    First-Order Queries over One Unary Function
    2
    Enumeration for FO Queries over Nowhere Dense Graphs
    14
    Enumeration of first-order queries on classes of structures with bounded expansion
    49
    Computing the jth solution of a first-order query
    11

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    Query evaluation via tree-decompositions
    243
    Parameterized Complexity
    3202
    The Design and Analysis of Computer Algorithms
    5363
    Elements of Finite Model Theory
    775
    Linear Time Computable Problems and First-Order Descriptions
    • D. Seese
    • Computer Science, Mathematics
    • 1996
    138
    Graphs properties checkable in linear time in the number
    • 2004