Links' Seminars and Public Events | ![]() ![]() |
Wed, January 8, 2020 1:30 pm 3:30 pm | Introduction to argumentation theory Salle Agora 1, Bâtiment ESPRIT |
Thu, December 19, 2019 11:00 am 1:30 pm | Thèse L. Gallois amphi Bâtiment B Inria |
Fri, December 13, 2019 11:45 am 1:00 pm | 1. On Parsing Gpath (Jérémy and Antonio) 2. On Nested Regular Expression (Joachim) |
Fri, December 13, 2019 10:30 am 11:45 am | Repet Lily pour l'équipe "Lille-Salle B31 " |
Tue, September 24, 2019 10:00 am 11:00 am | Stijn Vansummeren Title: General Dynamic Yannakakis: Conjunctive Queries with Theta Joins Under Updates Abstract: The ability to efficiently analyze changing data is a key requirement of many real-time analytics applications like Stream Processing, Complex Event Recognition, Business Intelligence, and Machine Learning. Traditional approaches to this problem are based either on the materialization of subresults (to avoid their recomputation) or on the recomputation of subresults (to avoid the space overhead of materialization). Both techniques have recently been shown suboptimal: instead of fully materializing results and subresults, one can maintain a data structure that supports efficient maintenance under updates and can quickly enumerate the full query output, as well as the changes produced under single updates. In our work we are concerned with designing a practical family of algorithms for dynamic query evaluation based on this idea, and for queries featuring both equi-joins and inequality joins, as well as certain forms of aggregation. Our main insight is that, for acyclic conjunctive queries, such algorithms can naturally be obtained by modifying Yannakakis' seminal algorithm for processing acyclic joins in the static setting. In this talk I present the main ideas behind this modfication, offset it against the traditional ways of doing incremental view maintenance, and discuss recent extensions such as dealing with general theta-joins. Amphitheater of INRIA Building B. |
Tue, June 25, 2019 11:30 am 5:30 pm | Happy Hours Inria Lille |
Tue, June 25, 2019 10:30 am 11:30 am | Seminar Véronique Benzaken and Évelyne Contejean Elles présenteront un outil qui prend en entrée une requête SQL et sa compilation par Postrgres sous forme de plan d'exécution, et démontre (avec Coq) que la requête initiale est équivalente au plan d'exécution. Lille-Salle B21 |
Fri, June 21, 2019 11:00 am 12:00 pm | Charles |
Fri, May 24, 2019 11:00 am 12:00 pm | Seminaire Sławek |
Fri, May 10, 2019 11:00 am 12:00 pm | Seminaire Iovka |
Fri, April 12, 2019 11:00 am 12:30 pm | Alexandre Vigny in Links Seminar |
Fri, April 5, 2019 11:00 am 12:00 pm | Semyon Grigorev in Links' seminar |
Fri, April 5, 2019 11:00 am 12:30 pm | Talk of Semyon Grigorev Title: Parsing techniques for context-free path querying Abstract: Context-free path querying (CFPQ) is a case of language constrained path querying: the way to specify constraints on paths in a graph in terms of formal languages. In CFPQ language is restricted to be a context-free. Classical parsing techniques and algorithms, such as generalized LR and LL parsing, or parser combinators, can be used for CFPQ. Results of adaptation of different parsing techniques for CFPQ will be presented. B31 |
Fri, March 22, 2019 10:00 am 11:30 am | Seminar LINKS by Aurelien Lemay "Tutorial: Grammatical Inference" |
Fri, March 8, 2019 11:00 am 12:00 pm | Seminar Momar Title: Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables
Abstract: We study the complexity of regular matching and inclusion for compressed tree patterns extended by context variables. The addition of context variables to tree patterns permits us to properly capture compressed string patterns but also compressed patterns for unranked trees with tree and hedge variables. Regular inclusion for the latter is relevant to certain query answering on Xml streams with references. |