VLDB 2026 Research / reviewers in the wild / expert
Lucas Schons
dblp:307/5099
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, 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
1 paper |
Graph data management · 87% Data models and query languages · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph data management
distributed graph processing |
0.6 | 1 | 2022 | Distributed temporal graph analytics with GRADOOP · VLDB J. 2022 |
Graph data management
temporal graph mining |
0.6 | 1 | 2022 | Distributed temporal graph analytics with GRADOOP · VLDB J. 2022 |
Data models and query languages
graph query language |
0.2 | 1 | 2022 | Distributed temporal graph analytics with GRADOOP · VLDB J. 2022 |
Methods — techniques the papers use, named apart from their topics
declarative query language · 0.6dataflow processing · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Distributed temporal graph analytics with GRADOOPabstractAbstract Temporal property graphs are graphs whose structure and properties change over time. Temporal graph datasets tend to be large due to stored historical information, asking for scalable analysis capabilities. We give a complete overview of Gradoop, a graph dataflow system for scalable, distributed analytics of temporal property graphs which has been continuously developed since 2005. Its graph model TPGM allows bitemporal modeling not only of vertices and edges but also of graph collections. A declarative analytical language called GrALa allows analysts to flexibly define analytical graph workflows by composing different operators that support temporal graph analysis. Built on a distributed dataflow system, large temporal graphs can be processed on a shared-nothing cluster. We present the system architecture of Gradoop, its data model TPGM with composable temporal graph operators, like snapshot, difference, pattern matching, graph grouping and several implementation details. We evaluate the performance and scalability of selected operators and a composed workflow for synthetic and real-world temporal graphs with up to 283 M vertices and 1.8 B edges, and a graph lifetime of about 8 years with up to 20 M new edges per year. We also reflect on lessons learned from the Gradoop effort. Christopher Rost, Kevin Gómez, Matthias Täschner, Philip Fritzsche, Lucas Schons, Lukas Christ, Timo Adameit, Martin Junghanns, Erhard Rahm |
VLDB J. | 5 |