International audienceWe consider the enumeration of MSO queries over strings under updates. For each MSO query we build an index structure enjoying the following properties: The index structure can be constructed in linear time, it can be updated in logarithmic time and it allows for constant delay time enumeration. This improves from the previous known index structures allowing for constant delay enumeration that would need to be reconstructed from scratch, hence in linear time, in the presence of updates. We allow relabeling updates, insertion of individual labels and removal of individual labels
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...
International audienceA Maximal Common Subsequence (MCS) between two strings X and Y is an inclusion...
International audienceThis paper proves that any fixed first-order query over any structure of bound...
We study how to evaluate MSO queries with free variables on trees, within the framework of enumerati...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
International audienceWe study the problem of enumerating the satisfying valuations of a circuit whi...
We survey recent results about enumerating with constant delay the answers to a query over a databas...
International audienceWe consider the enumeration problem of first-order queries over structures of ...
International audienceWe consider the evaluation of first-order queries over classes of databases w...
29 pages (with appendix) presented at ICDT21 conferenceInternational audienceIn the last years, enum...
We consider the enumeration problem of monadic second-order (MSO) queries with first-order free vari...
We investigate efficient view maintenance for MSO-definable queries over trees or, more precisely, e...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
This thesis is dedicated to the evaluation of logical queries from the enumeration point of view. Fi...
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...
International audienceA Maximal Common Subsequence (MCS) between two strings X and Y is an inclusion...
International audienceThis paper proves that any fixed first-order query over any structure of bound...
We study how to evaluate MSO queries with free variables on trees, within the framework of enumerati...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
We survey some of the recent results about enumerating the answers to queries over a database. We fo...
International audienceWe study the problem of enumerating the satisfying valuations of a circuit whi...
We survey recent results about enumerating with constant delay the answers to a query over a databas...
International audienceWe consider the enumeration problem of first-order queries over structures of ...
International audienceWe consider the evaluation of first-order queries over classes of databases w...
29 pages (with appendix) presented at ICDT21 conferenceInternational audienceIn the last years, enum...
We consider the enumeration problem of monadic second-order (MSO) queries with first-order free vari...
We investigate efficient view maintenance for MSO-definable queries over trees or, more precisely, e...
International audienceWe survey some of the recent results about enumerating the answers to queries ...
This thesis is dedicated to the evaluation of logical queries from the enumeration point of view. Fi...
Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) ...
International audienceA Maximal Common Subsequence (MCS) between two strings X and Y is an inclusion...
International audienceThis paper proves that any fixed first-order query over any structure of bound...