Thomas Minier

ORCID: 0000-0002-7321-286X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Semantic Web and Ontologies
  • Advanced Database Systems and Queries
  • Data Quality and Management
  • Biomedical Text Mining and Ontologies
  • Data Management and Algorithms
  • Scientific Computing and Data Management
  • Distributed systems and fault tolerance
  • Graph Theory and Algorithms
  • Advanced Data Storage Technologies
  • Data Mining Algorithms and Applications
  • Web Data Mining and Analysis
  • Natural Language Processing Techniques
  • Advanced Graph Neural Networks

Laboratoire des Sciences du Numérique de Nantes
2017-2022

Nantes Université
2018-2022

To provide stable and responsive public SPARQL query services, data providers enforce quotas on server usage. Queries which exceed these are interrupted deliver partial results. Such interruption is not an issue if it possible to resume queries execution afterward. Unfortunately, there no preemption model for the Web that allows suspending resuming queries. In this paper, we propose SaGe: a engine based preemption. SaGe be suspended by after fixed time quantum resumed upon client request....

10.1145/3308558.3313652 preprint EN 2019-05-13

Getting complete results when processing aggregate queries on public SPARQL endpoints is challenging, mainly due to the application of quotas. Although Web preemption supports online, preemptable servers, data transfer still very large count-distinct queries. In this paper, it shown that can be approximated with low by extending partial aggregation operator HyperLogLog++ sketches. Experimental demonstrate proposed approach outperforms existing approaches orders magnitude in terms amount transferred.

10.3233/sw-222842 article EN other-oa Semantic Web 2022-05-27

Semantic Web applications require querying available RDF Data with high performance and reliability. However, ensuring both data availability performant SPARQL query execution in the context of public servers are challenging problems. Queries could have arbitrary time unknown arrival rates. In this paper, we propose SaGe, a preemptive server-side engine. SaGe relies on preemptable physical plan operators. stops after given slice time, saves state sends saved back to client retrieved results....

10.48550/arxiv.1806.00227 preprint EN other-oa arXiv (Cornell University) 2018-01-01
Coming Soon ...