Issue |
RAIRO-Theor. Inf. Appl.
Volume 42, Number 1, January-March 2008
A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday
|
|
---|---|---|
Page(s) | 147 - 164 | |
DOI | https://doi.org/10.1051/ita:2007046 | |
Published online | 18 January 2008 |
Computing the jth solution of a first-order query
1
GREYC, Université de Caen, ENSICAEN, CNRS, Campus 2, 14032 Caen Cedex, France; gbagan@info.unicaen.fr; grandjean@info.unicaen.fr
2
Équipe de Logique Mathématique, Université
Denis Diderot, CNRS UMR 7056, 2 place Jussieu, 75251 Paris Cedex 05, France;
durand@logique.jussieu.fr
3
LIF, Université Aix-Marseille 1, CNRS, 39 rue Joliot Curie, 13453 Marseille Cedex 13, France; frederic.olive@lif.univ-mrs.fr
We design algorithms of “optimal" data complexity for several natural problems about first-order queries on structures of bounded degree. For that purpose, we first introduce a framework to deal with logical or combinatorial problems R ⊂ I x O whose instances x ∈ I may admit of several solutions R(x) = {y ∈ O : (x,y) ∈ R}. One associates to such a problem several specific tasks: compute a random (for the uniform probability distribution) solution y ∈ R(x); enumerate without repetition each solution yj in some specific linear order y0 < y1 < ... < yn-1 where R(x) = {y0,...,yn-1}; compute the solution yj of rank j in the linear order <.
Algorithms of “minimal" data complexity are presented for the following problems: given any first-order formula and any structure S of bounded degree:
(1) compute a random element of
;
(2) compute the jth element of
for some linear order of
;
(3) enumerate the elements of
in lexicographical order.
More precisely, we prove that, for any fixed formula φ, the above problem (1) (resp. (2), (3)) can be computed within average constant time (resp. within constant time, with constant delay) after a linear (O(|S|)) precomputation. Our essential tool for deriving those complexity results is a normalization procedure of first-order formulas on bijective structures.
Mathematics Subject Classification: 68Q15 / 68Q19
Key words: Complexity of enumeration / first-order queries / structures of bounded degree / linear time / constant time / constant delay
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.