We survey some of the recent results about enumerating the answers to queries over a database. We focus on the case where the enumeration is performed with a constant delay between any two consecutive solutions, after a linear time preprocessing. This cannot be always achieved. It requires restricting either the class of queries or the class of databases. We describe here several scenarios when this is possible
This thesis is concentrated around the problem of query evaluation. Given a query q and a database D...
We consider query problems defined by first order formulas of the form F(x,T) with free first order ...
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
We survey recent results about enumerating with constant delay the answers to a query over a databas...
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...
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 ...
International audienceWe consider the enumeration of MSO queries over strings under updates. For eac...
We consider the enumeration problem of monadic second-order (MSO) queries with first-order free vari...
A class of relational databases has low degree if for all δ, all but finitely many databases in the ...
We consider query problems defined by first order formulas of the form Φ(x,T) with free first order ...
International audienceA class of relational databases has low degree if for all delta, all but finit...
We consider the evaluation of first-order queries over classes of databases with bounded expansion. ...
This thesis is concentrated around the problem of query evaluation. Given a query q and a database D...
We consider query problems defined by first order formulas of the form F(x,T) with free first order ...
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
We survey recent results about enumerating with constant delay the answers to a query over a databas...
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...
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 ...
International audienceWe consider the enumeration of MSO queries over strings under updates. For eac...
We consider the enumeration problem of monadic second-order (MSO) queries with first-order free vari...
A class of relational databases has low degree if for all δ, all but finitely many databases in the ...
We consider query problems defined by first order formulas of the form Φ(x,T) with free first order ...
International audienceA class of relational databases has low degree if for all delta, all but finit...
We consider the evaluation of first-order queries over classes of databases with bounded expansion. ...
This thesis is concentrated around the problem of query evaluation. Given a query q and a database D...
We consider query problems defined by first order formulas of the form F(x,T) with free first order ...
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...