Demo Data from VLDB 2026 / reviewers in the wild / expert
Martin Heidel
dblp:204/3622
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2017
—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 |
Query processing and optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › runtime optimization › data skipping
partition pruning |
0.3 | 1 | 2017 | Statisticum: Data Statistics Management in SAP HANA · Proc. VLDB Endow. 2017 |
Query processing and optimization
query optimization |
0.3 | 1 | 2017 | Statisticum: Data Statistics Management in SAP HANA · Proc. VLDB Endow. 2017 |
Query processing and optimization › query optimization
statistics management |
0.1 | 1 | 2017 | Statisticum: Data Statistics Management in SAP HANA · Proc. VLDB Endow. 2017 |
Methods — techniques the papers use, named apart from their topics
implied integrity constraints · 0.3constraint data statistics · 0.3consistency checking · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Statisticum: Data Statistics Management in SAP HANAabstractWe introduce a new concept of leveraging traditional data statistics as dynamic data integrity constraints. These data statistics produce transient database constraints, which are valid as long as they can be proven to be consistent with the current data. We denote this type of data statistics by constraint data statistics , their properties needed for consistency checking by consistency metadata , and their implied integrity constraints by implied data statistics constraints ( implied constraints for short). Implied constraints are valid integrity constraints which are powerful query optimization tools employed, just as traditional database constraints, in semantic query transformation (aka query reformulation), partition pruning, runtime optimization, and semi-join reduction, to name a few. To our knowledge, this is the first work introducing this novel and powerful concept of deriving implied integrity constraints from data statistics. We discuss theoretical aspects of the constraint data statistics concept and their integration into query processing. We present the current architecture of data statistics management in SAP HANA and detail how constraint data statistics are designed and integrated into this architecture. As an instantiation of this framework, we consider dynamic partition pruning for data aging scenarios. We discuss our current implementation for constraint data statistics objects in SAP HANA which can be used for dynamic partition pruning. We enumerate their properties and show how consistency checking for implied integrity constraints is supported in the data statistics architecture. Our experimental evaluations on the TPC-H benchmark and a real customer application confirm the effectiveness of the implied integrity constraints; (1) for 59% of TPC-H queries, constraint data statistics utilization results in pruning cold partitions and reducing memory consumption, and (2) we observe up to 3 orders of magnitude speed-up in query processing time, for a real customer running an S/4HANA application. Anisoara Nica, Reza Sherkat, Mihnea Andrei, Martin Heidel, Christian Bensberg, Heiko Gerwens |
Proc. VLDB Endow. | 5 |