Nouvelles

Links' News

2020
Fri 24th Jul 2:30 pm 4:30 pm	Dr. Momar Sakho defended his PhD.
Mon 6th Jul to Fri 10th Jul  all day	École d'été Kocoon (cancelled) organisée par Florent Capelli, Pierre Marquis, Stefan Mengel, and Pierre Bourhis, à Lille More info at: kocoon.gforge.inria.fr/
Tue 30th Jun  all day	ICALP 2020 paper by Charles Paperman accepted On Polynomial Recursive Sequences ( Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michał Pilipczuk and Géraud Sénizergues ) drops.dagstuhl.de/opus.....7.pdf
2019
Mon 16th Dec to Thu 19th Dec  all day	Workshop Kocoon at Arras, organized by Pierre Bourhis, Florent Capelli, Pierre Marquis and Stefan Mengel More info at : kocoon.gforge.inria.fr/
Fri 27th Sep  all day	Mikael Monet visiting
Tue 4th Jun  all day	Arrivée de Fanny Canivet en stage de L3 : "Proof systems based on restricted Boolean circuits"
Fri 10th May 10:00 am 11:00 am	IJCAI'2019 paper by Sophie Tison et al. accepted. In cooperation with Montpellier: Oblivious and Semi-Oblivious Boundedness for Existential Rules” (P. Bourhis, F. Ulliana, M. Leclère, ML Mugnier, S. Tison, L. Gallois).
Mon 22nd Apr  all day	SAT'19 paper by Florent Capelli accepted Knowledge compilation languages as proof systems ,arxiv.org/abs/1903.04039 [ arxiv.org/abs/1903.04039 ]
Fri 12th Apr to Thu 18th Apr  all day	Rustam Azimov from Saint Petersburg visits Links
Mon 1st Apr to Fri 26th Apr  all day	Semyon Grigorev from Saint Petersburg visits Links Semyon is the supervisor of Rustam Azimov. He will work with Sylvain and Joachim Inria Lille

← −−  −  10 50 100 + ++ →

Team presentation

The appearance of linked data on the web calls for novel database management technologies for linked data collections. The classical challenges from database research need to be now raised for linked data: how to define exact logical queries, how to manage dynamic updates, and how to automatize the search for appropriate queries. In contrast to mainstream linked open data, the LINKS project will focus on linked data collections in various formats, under the assumption that the data is correct in most dimensions. The challenges remain difficult due to incomplete data, uninformative or heterogeneous schemas, and the remaining data errors and ambiguities. We will develop algorithms for evaluating and optimizing logical queries on linked data collections, incremental algorithms that can monitor streams of linked data and manage dynamical updates of linked data collections, and symbolic learning algorithms that can infer appropriate queries for linked data collections from examples.

Research themes

We will develop algorithms for answering logical querying on heterogeneous linked data collections in hybrid formats, distributed programming languages for managing dynamic linked data collections and workflows based on queries and mappings, and symbolic machine learning algorithms that can link datasets by inferring appropriate queries and mappings. Our main objectives are structured as follows:

• Querying heterogeneous linked data. We will develop new kinds of schema mappings for semi- structured datasets in hybrid formats including graph databases, rdf collections, and relational databases. These induce recursive queries on linked data collections for which we will investigate evaluation algo- rithms, static analysis problems, and concrete applications.
• Managing dynamic linked data. In order to manage dynamic linked data collections and workflows, we will develop distributed data-centric programming languages with streams and parallelism, based on novel algorithms for incremental query answering, will study the propagation of updates of dynamic data through schema mappings, and will investigate static analysis methods for linked data workflows.
• Linking graphs. Finally, we will develop symbolic machine learning algorithms, for inferring queries and mappings between linked data collections in various graphs formats from annotated examples.

International and industrial relations

• Stream Processing: QuiXTools (with Innovimax)
• FUI Hermes