EDBT 2026 Demo / reviewers in the wild / expert
Stefan Irimescu
dblp:251/9142
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1
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 |
Data models and query languages · 50% Distributed and cloud data management · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed and cloud data management
distributed query processing |
0.4 | 1 | 2020 | Rumble: Data Independence for Large Messy Data Sets · Proc. VLDB Endow. 2020 |
Data models and query languages › query language design
JSON query language |
0.4 | 1 | 2020 | Rumble: Data Independence for Large Messy Data Sets · Proc. VLDB Endow. 2020 |
Methods — techniques the papers use, named apart from their topics
iterator-based execution · 0.4data frame translation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Rumble: Data Independence for Large Messy Data SetsabstractThis paper introduces Rumble, a query execution engine for large, heterogeneous, and nested collections of JSON objects built on top of Apache Spark. While data sets of this type are more and more wide-spread, most existing tools are built around a tabular data model, creating an impedance mismatch for both the engine and the query interface. In contrast, Rumble uses JSONiq, a standardized language specifically designed for querying JSON documents. The key challenge in the design and implementation of Rumble is mapping the recursive structure of JSON documents and JSONiq queries onto Spark's execution primitives based on tabular data frames. Our solution is to translate a JSONiq expression into a tree of iterators that dynamically switch between local and distributed execution modes depending on the nesting level. By overcoming the impedance mismatch in the engine , Rumble frees the user from solving the same problem for every single query, thus increasing their productivity considerably. As we show in extensive experiments, Rumble is able to scale to large and complex data sets in the terabyte range with a similar or better performance than other engines. The results also illustrate that Codd's concept of data independence makes as much sense for heterogeneous, nested data sets as it does on highly structured tables. Ingo Müller 0002, Ghislain Fourny, Stefan Irimescu, Can Berker Cikis, Gustavo Alonso |
Proc. VLDB Endow. | 3 |