Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) LaHDAK
Beyond declarative mapping and cleaning
Paolo Papotti

02 February 2015, 14h00 - 02 February 2015, 16h00
Salle/Bat : 445/PCRI-N
Contact : ppapotti@qf.org.qa

Activités de recherche : Algorithmes pour les grands volumes de données distribuées

Résumé :
In the "big data" era, data integration is a popular activity both in
academia and in industry. Integrating hundreds of heterogeneous
sources on a daily basis requires a great amount of manual work in
order to have data that is polished enough to be useful in the final
applications, such as querying and mining. The problem is ever harder in practice, as data is often dirty in nature because of typos, duplicates, and so on, that can lead to poor results in the analytic tasks.

Over the last ten years, several successful systems have been proposed to tackle this challenge with a formal, declarative approach based on first order logic. However, despite the positive results, there is still a gap between these proposals and the leading commercial systems. The latter are harder to maintain, to debug, and to test, but provide the level of personalization and detail that are needed to solve “real-world” problems. In this talk, I will describe some of my results in tackling mapping and cleaning with a declarative approach, and how this experience has pushed me to explore a new way that can take the best of both worlds.

Short Bio:

Paolo Papotti is a scientist in the Data Analytics center at Qatar
Computing Research Institute (QCRI). He holds a Ph.D degree in
computer science from Roma Tre University (Italy, 2007), where he also was Assistant Professor before joining QCRI. He had visiting appointments at IBM Almaden (USA) and at the UC Santa Cruz (USA). His research topics are in the general area of information integration and data quality.

Pour en savoir plus : http://www.qcri.qa/our-people/bio?pid=34&name=PaoloPapotti
Séminaires
The Domino Problem is undecidable on surface group
Combinatoire
Friday 27 September 2019 - 14h30
Salle : 445 - PCRI-N
Nathalie Aubrun .............................................

Scalable Load Balancing - Distributed Algorithms a
Algorithmique distribuée
Friday 20 September 2019 - 14h30
Salle : 445 - PCRI-N
Vinicius Marino Calvo Torres de Freitas .............................................

graph algorithms to help molecular construction
Théorie des graphes
Friday 07 June 2019 - 14h30
Salle : 445 - PCRI-N
Stefi Nouleho .............................................

Sur le nombre des (d,k)-polytopes
Combinatoire
Friday 24 May 2019 - 14h30
Salle : 455 - PCRI-N
Rado Rakotonarivo .............................................

Predicting the structure of RNA-binding protein re
Thursday 23 May 2019 - 00h00
Salle : 465 - PCRI-N
François Major .............................................