Seminars

Links' Seminars and Public Events Add to google calendar
2019
Fri 13th Dec
10:30 am
11:45 am
Add event to google
Repet Lily pour l'équipe
"Lille-Salle B31 "
Tue 24th Sep
10:00 am
11:00 am
Add event to google
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.
Show in Google map
Amphitheater of INRIA Building B.
Tue 25th Jun
11:30 am
5:30 pm
Add event to google
Happy Hours
Show in Google map
Inria Lille
Tue 25th Jun
10:30 am
11:30 am
Add event to google
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.
Show in Google map
Lille-Salle B21
Fri 21st Jun
11:00 am
12:00 pm
Add event to google
Charles
Fri 24th May
11:00 am
12:00 pm
Add event to google
Seminaire Sławek
Fri 10th May
11:00 am
12:00 pm
Add event to google
Seminaire Iovka
Fri 12th Apr
11:00 am
12:30 pm
Add event to google
Alexandre Vigny in Links Seminar
Fri 5th Apr
11:00 am
12:30 pm
Add event to google
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.
Show in Google map
B31
Fri 5th Apr
11:00 am
12:00 pm
Add event to google
Semyon Grigorev in Links' seminar

Permanent link to this article: https://team.inria.fr/links/seminars/