EDBT 2026 Demo / reviewers in the wild / expert
Arnaud Delamare
dblp:281/7298
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Query processing and optimization · 64% Graph data management · 36% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
GPUs and heterogeneous computing · 85% Distributed systems · 15% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › query execution
in-situ query processing |
0.9 | 1 | 2025 | GpJSON: High-performance JSON Data Processing on GPUs · Proc. VLDB Endow. 2025 |
GPUs and heterogeneous computing
GPU-accelerated data processing |
0.9 | 1 | 2025 | GpJSON: High-performance JSON Data Processing on GPUs · Proc. VLDB Endow. 2025 |
Graph data management › graph query processing
distributed graph queries |
0.5 | 1 | 2021 | aDFS: An Almost Depth-First-Search Distributed Graph-Querying System · USENIX ATC 2021 |
Distributed systems › distributed database
distributed query processing |
0.1 | 1 | 2021 | aDFS: An Almost Depth-First-Search Distributed Graph-Querying System · USENIX ATC 2021 |
Methods — techniques the papers use, named apart from their topics
parallel structural index construction · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Domain-specific language engineering for large-scale graph analytics using Spoofax: An industry report
Houda Boukham, Guido Wachsmuth, Oskar van Rest, Hassan Chafi, Sungpack Hong, Martijn Dwars, Arnaud Delamare, Hamza Boucherit, Dalila Chiadmi |
Sci. Comput. Program. | 7 |
| 2025 | GpJSON: High-performance JSON Data Processing on GPUsabstractThe JavaScript Object Notation (JSON) format is ubiquitous, and countless applications depend on it to store and exchange high volumes of data. Despite its great popularity, JSON is nevertheless a very inefficient data format: decoding and querying JSON data is often a major bottleneck for many data-intensive applications. In this paper, we explore how Graphics Processing Units (GPUs) can be used to parallelize both JSON de-serialization and querying. We show how JSON parsing can be implemented on GPUs by means of parallel structural index construction, and we describe how JSON data can then be queried in situ using a lightweight query engine designed to run on GPUs. We present the design and implementation of GpJSON, a GPU-based JSON data processing library. The library can be used from high-level languages such as JavaScript or Python, and features bindings for the GraalVM language runtime. Our evaluation on real-world datasets shows that, on a single NVIDIA Ampere A100, GpJSON achieves at least 2.9x speedup on end-to-end performance (de-serialization plus querying) over state-of-the-art parallel JSON parsers and query engines, and 6-8 x over NVIDIA RAPIDS. Sacheendra Talluri, Guido Walter Di Donato, Luca Danelutti, Koen Vlaswinkel, Marco Arnaboldi, Arnaud Delamare, Marco D. Santambrogio, Daniele Bonetta |
Proc. VLDB Endow. | 6 |
| 2021 | DAG-based Scheduling with Resource Sharing for Multi-task Applications in a Polyglot GPU RuntimeabstractGPUs are readily available in cloud computing and personal devices, but their use for data processing acceleration has been slowed down by their limited integration with common programming languages such as Python or Java. Moreover, using GPUs to their full capabilities requires expert knowledge of asynchronous programming. In this work, we present a novel GPU run time scheduler for multi-task GPU computations that transparently provides asynchronous execution, space-sharing, and transfer-computation overlap without requiring in advance any information about the program dependency structure. We leverage the GrCUDA polyglot API to integrate our scheduler with multiple high-level languages and provide a platform for fast prototyping and easy GPU acceleration. We validate our work on 6 benchmarks created to evaluate task-parallelism and show an average of 44% speedup against synchronous execution, with no execution time slowdown compared to hand-optimized host code written using the C++ CUDA Graphs API. Alberto Parravicini, Arnaud Delamare, Marco Arnaboldi, Marco D. Santambrogio |
IPDPS | 2 |
| 2021 | aDFS: An Almost Depth-First-Search Distributed Graph-Querying System
Vasileios Trigonakis, Jean-Pierre Lozi, Tomás Faltín, Nicholas P. Roth, Iraklis Psaroudakis, Arnaud Delamare, Vlad Haprian, Calin Iorgulescu, Petr Koupy, Jinsoo Lee, Sungpack Hong, Hassan Chafi |
USENIX ATC | 6 |