Hubert Naacke
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hubert Naacke has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Stéphane Gançarski
Lip6, Sorbonne University
5 shared publications - Sara Jarrad
Lip6, Sorbonne University
4 shared publications - Ibrahima Gueye
Ecole Polytechnique de Thiès, LTISI
3 shared publications Idrissa Sarr
Département Mathématiques Informatique
2 shared publications- Idrissa Sarr
Université Cheikh Anta Diop
2 shared publications - Modou Gueye
Institut Telecom -Telecom ParisTech 46, rue Barrault 75013 Paris France
2 shared publications
Latest Publications
- 11 October 2026
- Published by Springer Nature
- p. 274-283
Top-k on Sequences: A Generic Approach for Similarity Search
- 11 October 2026
- Published by Springer Nature
- p. 274-283
Top-k on Sequences: A Generic Approach for Similarity Search
- 23 November 2025
- Published by Springer Nature
- p. 32-60
SISIS: Sequence Indexing for SImilarity Search
- 4 December 2024
- Published by Springer Nature
- p. 229-235
SISIS : Sequence Indexing for SImilarity Search
- 4 December 2024
- Published by Springer Nature
- p. 229-235
SISIS : Sequence Indexing for SImilarity Search
- 4 December 2024
- Published by Springer Nature
- p. 236-251
Top-k on Sequences: A New Approach to Enhanced Similarity Search
- 4 December 2024
- Published by Springer Nature
- p. 236-251
Top-k on Sequences: A New Approach to Enhanced Similarity Search
- 22 August 2024
- Published by Springer Nature
- p. 366-382
Leiden-Fusion Partitioning Method for Effective Distributed Training of Graph Embeddings
- 22 August 2024
- Published by Springer Nature
- p. 366-382
Leiden-Fusion Partitioning Method for Effective Distributed Training of Graph Embeddings
- 1 November 2021
- Published by Elsevier in Big Data Research
- Vol. 26
An Analytic Graph Data Model and Query Language for Exploring the Evolution of Science
- 1 November 2021
- Published by Elsevier in Big Data Research
- Vol. 26
An Analytic Graph Data Model and Query Language for Exploring the Evolution of Science
- 6 August 2020
- Published by Springer Nature
- p. 264-273
Enriching Geolocalized Dataset with POIs Descriptions at Large Scale
- 6 August 2020
- Published by Springer Nature
- p. 264-273
Enriching Geolocalized Dataset with POIs Descriptions at Large Scale
- Open Access
BigSR: an empirical study of real-time expressive RDF stream reasoning on modern Big Data platforms
The trade-off between language expressiveness and system scalability (E&S) is a well-known problem in RDF stream reasoning. Higher expressiveness supports more complex reasoning logic, however, it may also hinder system scalability. Current research mainly focuses on logical frameworks suitable for stream reasoning as well as the implementation and the evaluation of prototype systems. These systems are normally developed in a centralized setting which suffer from inherent limited scalability, while an in-depth study of applying distributed solutions to cover E&S is still missing. In this paper, we aim to explore the feasibility of applying modern distributed computing frameworks to meet E&S all together. To do so, we first propose BigSR, a technical demonstrator that supports a positive fragment of the LARS framework. For the sake of generality and to cover a wide variety of use cases, BigSR relies on the two main execution models adopted by major distributed execution frameworks: Bulk Synchronous Processing (BSP) and Record-at-A-Time (RAT). Accordingly, we implement BigSR on top of Apache Spark Streaming (BSP model) and Apache Flink (RAT model). In order to conclude on the impacts of BSP and RAT on E&S, we analyze the ability of the two models to support distributed stream reasoning and identify several types of use cases characterized by their levels of support. This classification allows for quantifying the E&S trade-off by assessing the scalability of each type of use case \wrt its level of expressiveness. Then, we conduct a series of experiments with 15 queries from 4 different datasets. Our experiments show that BigSR over both BSP and RAT generally scales up to high throughput beyond million-triples per second (with or without recursion), and RAT attains sub-millisecond delay for stateless query operators.
Open AccessBigSR: an empirical study of real-time expressive RDF stream reasoning on modern Big Data platforms
The trade-off between language expressiveness and system scalability (E&S) is a well-known problem in RDF stream reasoning. Higher expressiveness supports more complex reasoning logic, however, it may also hinder system scalability. Current research mainly focuses on logical frameworks suitable for stream reasoning as well as the implementation and the evaluation of prototype systems. These systems are normally developed in a centralized setting which suffer from inherent limited scalability, while an in-depth study of applying distributed solutions to cover E&S is still missing. In this paper, we aim to explore the feasibility of applying modern distributed computing frameworks to meet E&S all together. To do so, we first propose BigSR, a technical demonstrator that supports a positive fragment of the LARS framework. For the sake of generality and to cover a wide variety of use cases, BigSR relies on the two main execution models adopted by major distributed execution frameworks: Bulk Synchronous Processing (BSP) and Record-at-A-Time (RAT). Accordingly, we implement BigSR on top of Apache Spark Streaming (BSP model) and Apache Flink (RAT model). In order to conclude on the impacts of BSP and RAT on E&S, we analyze the ability of the two models to support distributed stream reasoning and identify several types of use cases characterized by their levels of support. This classification allows for quantifying the E&S trade-off by assessing the scalability of each type of use case \wrt its level of expressiveness. Then, we conduct a series of experiments with 15 queries from 4 different datasets. Our experiments show that BigSR over both BSP and RAT generally scales up to high throughput beyond million-triples per second (with or without recursion), and RAT attains sub-millisecond delay for stateless query operators.
- 4 November 2015
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Revue Africaine de La Recherche En Informatique Et Mathématiques Appliquées
- Vol. ume 21 - 2
Optimisation de requêtes dynamiques pour l'analyse de la biodiversité
La quantité des données produites par de nombreux domaines augmente constamment et rend leur traitement de plus en plus difficile à gérer. Parmi ces domaines nous nous intéressons à la biodiversité pour laquelle le GBIF (Global Biodiversity Information Facility) vise à fédérer et partager les données de biodiversité produites par de nombreux fournisseurs à l’échelle mondiale. Aujourd’hui, avec un nombre croissant d’utilisateurs caractérisés par un comportement versatile et une fréquence d’accès aux données très aléatoire, les solutions actuelles n’ont pas été conçues pour s’adapter dynamiquement à ce type de situation. Par ailleurs, avec un nombre croissant de fournisseurs de données et d’utilisateurs qui interrogent sa base, le GBIF est confronté à un problème d’efficacité difficile à résoudre. Nous visons, dans cet article, à résoudre les problèmes de performances du GBIF. Dans cette perspective, nous proposons une approche d’optimisation de requête d’analyse de données de biodiversité qui s’adapte dynamiquement au contexte des environnements répartis à large échelle pour garantir la disponibilité des données. L’implémentation de notre solution et les résultats des expériences sont satisfaisants pour la garantie de performance et du passage à l’échelle.
- 4 November 2015
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Revue Africaine de La Recherche En Informatique Et Mathématiques Appliquées
- Vol. ume 21 - 2
Optimisation de requêtes dynamiques pour l'analyse de la biodiversité
La quantité des données produites par de nombreux domaines augmente constamment et rend leur traitement de plus en plus difficile à gérer. Parmi ces domaines nous nous intéressons à la biodiversité pour laquelle le GBIF (Global Biodiversity Information Facility) vise à fédérer et partager les données de biodiversité produites par de nombreux fournisseurs à l’échelle mondiale. Aujourd’hui, avec un nombre croissant d’utilisateurs caractérisés par un comportement versatile et une fréquence d’accès aux données très aléatoire, les solutions actuelles n’ont pas été conçues pour s’adapter dynamiquement à ce type de situation. Par ailleurs, avec un nombre croissant de fournisseurs de données et d’utilisateurs qui interrogent sa base, le GBIF est confronté à un problème d’efficacité difficile à résoudre. Nous visons, dans cet article, à résoudre les problèmes de performances du GBIF. Dans cette perspective, nous proposons une approche d’optimisation de requête d’analyse de données de biodiversité qui s’adapte dynamiquement au contexte des environnements répartis à large échelle pour garantir la disponibilité des données. L’implémentation de notre solution et les résultats des expériences sont satisfaisants pour la garantie de performance et du passage à l’échelle.
- 11 August 2015
- Published by Springer Nature
- p. 295-303
Supporting Fluctuating Transactional Workload