Demo Data from EDBT 2026 / reviewers in the wild / expert
Gregory Dorman
dblp:10/955
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2003
—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 · 67% Data models and query languages · 33% |
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 › OLAP
OLAP query optimization |
0.0 | 1 | 2003 | Spreadsheets in RDBMS for OLAP · SIGMOD Conference 2003 |
Query processing and optimization › OLAP
OLAP query processing |
0.0 | 1 | 2003 | Spreadsheets in RDBMS for OLAP · SIGMOD Conference 2003 |
Data models and query languages › SQL
SQL extension |
0.0 | 1 | 2003 | Spreadsheets in RDBMS for OLAP · SIGMOD Conference 2003 |
Methods — techniques the papers use, named apart from their topics
array-based execution models · 0.0SQL window functions · 0.0MOLAP engines · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Spreadsheets in RDBMS for OLAPabstractOne of the critical deficiencies of SQL is lack of support for n-dimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications have to emulate them using joins, recently introduced SQL Window Functions [18] and complex and inefficient CASE expressions. The designated place in SQL for specifying calculations is the SELECT clause, which is extremely limiting and forces the user to generate queries using nested views, subqueries and complex joins. Furthermore, SQL-query optimizer is pre-occupied with determining efficient join orders and choosing optimal access methods and largely disregards optimization of complex numerical formulas. Execution methods concentrated on efficient computation of a cube [11], [16] rather than on random access structures for inter-row calculations. This has created a gap that has been filled by spreadsheets and specialized MOLAP engines, which are good at formulas for mathematical modeling but lack the formalism of the relational model, are difficult to manage, and exhibit scalability problems. This paper presents SQL extensions involving array based calculations for complex modeling. In addition, we present optimizations, access structures and execution models for processing them efficiently. 1 Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozkaya, Gregory Dorman, Nathan Folkert, Abhinav Gupta 0003, Sankar Subramanian |
SIGMOD Conference | 4 |