Presentation

Nouvelles

Links' News Add to google calendar
2019
ven 18th Jan
 all day
Add event to google
Visit of Marie-Laure Mugnier and Federico Ulliana from Montpellier
Show in Google map
Inria
40 Avenue Halley, 59650 Villeneuve-d'Ascq, France
2018
jeu 20th Déc
5:00 
6:00 
Add event to google
STACS'19 paper by Florent Capelli accepted: "Tractable QBF via Knowledge Compilation" with Stefan Mengel
ven 16th Nov
11:00 
12:30 
Add event to google
Aurelien Lemay's Habilitation defense
Show in Google map
IRCICA
lun 5th Nov
9:00 
10:00 
Add event to google
Bruno Guillon arrives: our new postdoc working on distributed databases
lun 15th Oct
to mar 16th Oct
 all day
Add event to google
Show in Google map
Inria
40 Avenue Halley, 59650 Villeneuve d'Ascq, France
lun 17th Sep
 all day
Add event to google
lun 3rd Sep
11:00 
12:00 
Add event to google
Sławek Staworko's paper on SheX containment got accepted at PODS 2019!
mar 28th Août
to ven 31st Août
 all day
Add event to google
A major conference on logic in AI origanized in Lille.
Show in Google map
EuraTechnologies, Lille, France
lun 27th Août
 all day
Add event to google
Rustam Azimov, a PhD student from Petersburg, starts his 3-months visit of Links. He will work with Sylvain Slavati and Joachim Niehren.
lun 16th Avr
 all day
Add event to google
ICALP'18 paper accepted by Charles Paperman
Constrained Topological Sorting by Antoine Amarilli and Charles Paperman arxiv.org/pdf/1707.04310.pdf
jeu 15th Mar
 all day
Add event to google
ShEx 2.0 Release of Java Implementation
Publication of a first version of the implementation of ShEx 2.0 in java
[ github.com/iovka/shex-java | github.com/iovka/shex-java ]
jeu 1st Fév
to jeu 8th Fév
 all day
Add event to google
Visit of Vincent Penelle, Université de Bordeaux
mar 16th Jan
 all day
Add event to google
Visit of Yann Strozecki, Université de Versailles

lun 8th Jan
 all day
Add event to google
Arrival of Jérémie Dusard
Jérémie will work as an engineer on ShEx with Iovka Boneva
mer 3rd Jan
10:00 
11:00 
Add event to google
I. Boneva published a book published with the W3C on schemas validation for the semantic Web
2017
mar 19th Déc
5:00 
6:00 
Add event to google
Annual report of Links 2017 is ready.
lun 4th Sep
5:00 
6:00 
Add event to google
ISWC 2017 paper accepted
By Iovka Boneva, Jose E. Labra Gayo, Eric G. Prud'hommeaux: Semantics and Validation of Shapes Schemas for RDF
hal.archives-ouvertes.fr/hal-01590350
mer 30th Août
11:00 
12:00 
Add event to google
Arrival of Florent Capelli as associate professor in Links
lun 28th Août
11:00 
12:00 
Add event to google
Arrival of Charles Paperman as associate professor in Links
mar 16th Mai
 all day
Add event to google
Medal "Palme Academique" for Sophie Tison
Show in Google map
by the Université de Lille 1
mar 9th Mai
 all day
Add event to google
Pierre Bourhis' paper with Oxford (Benedikt and Vanden Boom) in Track B of ICALP'17 won the best paper award!
Show in Google map
Warsaw, Poland
mer 3rd Mai
 all day
Add event to google
Vincent Hugot, Adrien Boiret, and Joachim Niehren: Equivalence of Symbolic Tree Transducers
Show in Google map
Liege, Belgium
sam 22nd Avr
 all day
Add event to google
IJCAI'17 paper accepted
Sophie Tison and Pierre Bourhis with Montpellier (Bienvenu, Mugier, Ulliana): Ontology-Mediated Query Answering for Key-Value Stores
Show in Google map
Melbourne
sam 22nd Avr
 all day
Add event to google
IJCAI'17 paper accepted
Pierre Bourhis with Vienna (Morak and Pieris): Making Cross Products and Guarded Ontology Languages Compatible
Show in Google map
Melbourne
ven 14th Avr
 all day
Add event to google
Nicolas Bacquey with Etienne Grandjean (Caen) and Frédéric Olive (Marseille):
Definability by Horn formulas and linear time on cellular automata
Show in Google map
Warsaw
ven 14th Avr
 all day
Add event to google
Pierre Bourhis with Amarilli (Telecom Paristec), Jachiet (Lens) and Mengel (Lens):
A Circuit-Based Approach to Efficient Enumeration
Show in Google map
Warsaw
ven 14th Avr
 all day
Add event to google
Pierre Bourhis with Oxford (Benedikt and Vanden Boom):
Characterizing Definability in Decidable Fixpoint Logics
Show in Google map
Warsaw
ven 31st Mar
 all day
Add event to google
Lille-Oxford cooperation project accepted
Funded by University of Lille. Contact: Pierre Bourhis
ven 31st Mar
 all day
Add event to google
Edinburgh-Links exchange projet accepted
Funded by University of Lille. Coordinator: Slawek Staworko
jeu 2nd Fév
 all day
Add event to google
Sylvain Salvati with Bordeaux (Gallot, Musholl, and Puppis): On the decomposition of finite-valued streaming string transducers

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

Lien Permanent pour cet article : https://team.inria.fr/links/fr/