International audienceWe 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
We consider query problems defined by first order formulas of the form F(x,T) with free first order ...
International audienceWe study the problem of enumerating the satisfying valuations of a circuit whi...
We study the complexity of enumerating the answers of Conjunctive Queries (CQs) in the presence of F...
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...
We survey recent results about enumerating with constant delay the answers to a query over a databas...
International audienceWe consider the evaluation of first-order queries over classes of databases w...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
International audienceWe consider the enumeration problem of first-order queries over structures of ...
International audienceWe consider the evaluation of ÿrst-order queries over classes of databases tha...
International audienceWe consider the enumeration of MSO queries over strings under updates. For eac...
International audienceThis paper proves that any fixed first-order query over any structure of bound...
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...
This thesis is concentrated around the problem of query evaluation. Given a query q and a database D...
International audienceWe consider the evaluation of first-order queries over classes of databases wi...
We consider query problems defined by first order formulas of the form F(x,T) with free first order ...
International audienceWe study the problem of enumerating the satisfying valuations of a circuit whi...
We study the complexity of enumerating the answers of Conjunctive Queries (CQs) in the presence of F...
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...
We survey recent results about enumerating with constant delay the answers to a query over a databas...
International audienceWe consider the evaluation of first-order queries over classes of databases w...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
International audienceWe consider the enumeration problem of first-order queries over structures of ...
International audienceWe consider the evaluation of ÿrst-order queries over classes of databases tha...
International audienceWe consider the enumeration of MSO queries over strings under updates. For eac...
International audienceThis paper proves that any fixed first-order query over any structure of bound...
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...
This thesis is concentrated around the problem of query evaluation. Given a query q and a database D...
International audienceWe consider the evaluation of first-order queries over classes of databases wi...
We consider query problems defined by first order formulas of the form F(x,T) with free first order ...
International audienceWe study the problem of enumerating the satisfying valuations of a circuit whi...
We study the complexity of enumerating the answers of Conjunctive Queries (CQs) in the presence of F...