EDBT 2026 Demo / reviewers in the wild / expert
Thi Hoang Thi Pham
dblp:335/9906
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-0176-2245ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
1 paper |
Graph data management · 30% Knowledge graphs · 30% Query processing and optimization · 30% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs
knowledge graph querying |
0.9 | 1 | 2025 | Passage: Ensuring Completeness and Responsiveness of Public SPARQL Endpoints with SPARQL Continuation Queries · WWW 2025 |
Query processing and optimization
query completeness |
0.9 | 1 | 2025 | Passage: Ensuring Completeness and Responsiveness of Public SPARQL Endpoints with SPARQL Continuation Queries · WWW 2025 |
Graph data management › RDF data management
SPARQL query processing |
0.9 | 1 | 2025 | Passage: Ensuring Completeness and Responsiveness of Public SPARQL Endpoints with SPARQL Continuation Queries · WWW 2025 |
Methods — techniques the papers use, named apart from their topics
query continuation · 0.9fair use policy enforcement · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Passage: Ensuring Completeness and Responsiveness of Public SPARQL Endpoints with SPARQL Continuation QueriesabstractBeing able to query online public knowledge graphs such as Wikidata or DBpedia is extremely valuable. However, these queries can be interrupted due to the fair use policies enforced by SPARQL endpoint providers, leading to incomplete results. While these policies help maintain the responsiveness of public SPARQL endpoints, they compromise the completeness of query results, which limits the feasibility of various downstream tasks. Ideally, we should not have to choose between completeness and responsiveness. To address this issue, we introduce and formalize the concept of SPARQL continuation queries. When a SPARQL endpoint interrupts a query, it returns partial results along with a SPARQL continuation query to retrieve the remaining results. If the continuation query is also interrupted, the process repeats, generating further continuation queries until the complete results are obtained. In our experimentation, we show that our continuation server PASSAGE ensures completeness and responsiveness while delivering high performance. Thi Hoang Thi Pham, Gabriela Montoya, Brice Nédelec, Hala Skaf-Molli, Pascal Molli |
WWW | 1 |
| 2024 | CRAWD: Sampling-Based Estimation of Count-Distinct SPARQL Queries
Thi Hoang Thi Pham, Pascal Molli, Brice Nédelec, Hala Skaf-Molli, Julien Aimonier-Davat |
ISWC (2) | 1 |