We survey recent results about enumerating with constant delay the answers to a query over a database. More precisely, we focus on the case when enumeration can be achieved with a preprocessing running in time linear in the size of the database, followed by an enumeration process outputting the answers one by one with constant time between any consecutive outputs. We survey classes of databases and classes of queries for which this is possible. We also mention related problems such as computing the number of answers or sampling the set of answers
We consider query problems defined by first order formulas of the form Φ(x,T) with free first order ...
We present an efficient answer enumeration algorithm for a fragment of Conditional XPath with variab...
International audienceWe consider the evaluation of first-order queries over classes of databases wi...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
International audienceWe consider the evaluation of first-order queries over classes of databases w...
A class of relational databases has low degree if for all δ, all but finitely many databases in the ...
International audienceA class of relational databases has low degree if for all delta, all but finit...
International audienceWe consider the evaluation of ÿrst-order queries over classes of databases tha...
We consider the enumeration problem of first-order queries over structures ofbounded degree. It was ...
This thesis is concentrated around the problem of query evaluation. Given a query q and a database D...
International audienceWe consider the enumeration of MSO queries over strings under updates. For eac...
We consider the evaluation of first-order queries over classes of databases with bounded expansion. ...
We consider the enumeration problem of monadic second-order (MSO) queries with first-order free vari...
We consider query problems defined by first order formulas of the form Φ(x,T) with free first order ...
We present an efficient answer enumeration algorithm for a fragment of Conditional XPath with variab...
International audienceWe consider the evaluation of first-order queries over classes of databases wi...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
International audienceWe consider the evaluation of first-order queries over classes of databases w...
A class of relational databases has low degree if for all δ, all but finitely many databases in the ...
International audienceA class of relational databases has low degree if for all delta, all but finit...
International audienceWe consider the evaluation of ÿrst-order queries over classes of databases tha...
We consider the enumeration problem of first-order queries over structures ofbounded degree. It was ...
This thesis is concentrated around the problem of query evaluation. Given a query q and a database D...
International audienceWe consider the enumeration of MSO queries over strings under updates. For eac...
We consider the evaluation of first-order queries over classes of databases with bounded expansion. ...
We consider the enumeration problem of monadic second-order (MSO) queries with first-order free vari...
We consider query problems defined by first order formulas of the form Φ(x,T) with free first order ...
We present an efficient answer enumeration algorithm for a fragment of Conditional XPath with variab...
International audienceWe consider the evaluation of first-order queries over classes of databases wi...