Jan Kossmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jan Kossmann has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Felix Naumann
Hasso Plattner Institute, University of Potsdam, Potsdam, Germany
2 shared publications - Thorsten Papenbrock
Philipps University of Marburg
2 shared publications - Alexander Löser
Technische Universität Berlin, Berlin, Germany
1 shared publication - Andreas Kipf
University of Technology Nuremberg, Nuremberg, Germany
1 shared publication - Andreas Zimmerer
University of Technology Nuremberg, Nuremberg, Germany
1 shared publication - Damien Dam
Snowflake Inc., Berlin, Germany
1 shared publication
Latest Publications
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 757-770
Pruning in Snowflake: Working Smarter, Not Harder
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 757-770
Open AccessPruning in Snowflake: Working Smarter, Not Harder
- 28 December 2021
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (2) , 471
Correction to: Data dependencies for query optimization: a survey
- 28 December 2021
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (2) , 471
Correction to: Data dependencies for query optimization: a survey
- 17 July 2021
- Published by Springer Nature
- p. 3-13
Learned What-If Cost Models for Autonomous Clustering
- 17 July 2021
- Published by Springer Nature
- p. 3-13
Learned What-If Cost Models for Autonomous Clustering
- Open Access
- 14 June 2021
- Published by Springer Nature in The VLDB Journal
- Vol. 31 (1) , 1-22
Data dependencies for query optimization: a survey
Effective query optimization is a core feature of any database management system. While most query optimization techniques make use of simple metadata, such as cardinalities and other basic statistics, other optimization techniques are based on more advanced metadata including data dependencies, such as functional, uniqueness, order, or inclusion dependencies. This survey provides an overview, intuitive descriptions, and classifications of query optimization and execution strategies that are enabled by data dependencies. We consider the most popular types of data dependencies and focus on optimization strategies that target the optimization of relational database queries. The survey supports database vendors to identify optimization opportunities as well as DBMS researchers to find related work and open research questions.
- 14 June 2021
- Published by Springer Nature in The VLDB Journal
- Vol. 31 (1) , 1-22
Open AccessData dependencies for query optimization: a survey
Effective query optimization is a core feature of any database management system. While most query optimization techniques make use of simple metadata, such as cardinalities and other basic statistics, other optimization techniques are based on more advanced metadata including data dependencies, such as functional, uniqueness, order, or inclusion dependencies. This survey provides an overview, intuitive descriptions, and classifications of query optimization and execution strategies that are enabled by data dependencies. We consider the most popular types of data dependencies and focus on optimization strategies that target the optimization of relational database queries. The survey supports database vendors to identify optimization opportunities as well as DBMS researchers to find related work and open research questions.
- Open Access
- 16 March 2020
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 38 (4) , 795-817
Self-driving database systems: a conceptual approach
Challenges for self-driving database systems, which tune their physical design and configuration autonomously, are manifold: Such systems have to anticipate future workloads, find robust configurations efficiently, and incorporate knowledge gained by previous actions into later decisions. We present a component-based framework for self-driving database systems that enables database integration and development of self-managing functionality with low overhead by relying on separation of concerns. By keeping the components of the framework reusable and exchangeable, experiments are simplified, which promotes further research in that area. Moreover, to optimize multiple mutually dependent features, e.g., index selection and compression configurations, we propose a linear programming (LP) based algorithm to derive an efficient tuning order automatically. Afterwards, we demonstrate the applicability and scalability of our approach with reproducible examples.
- 16 March 2020
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 38 (4) , 795-817
Open AccessSelf-driving database systems: a conceptual approach
Challenges for self-driving database systems, which tune their physical design and configuration autonomously, are manifold: Such systems have to anticipate future workloads, find robust configurations efficiently, and incorporate knowledge gained by previous actions into later decisions. We present a component-based framework for self-driving database systems that enables database integration and development of self-managing functionality with low overhead by relying on separation of concerns. By keeping the components of the framework reusable and exchangeable, experiments are simplified, which promotes further research in that area. Moreover, to optimize multiple mutually dependent features, e.g., index selection and compression configurations, we propose a linear programming (LP) based algorithm to derive an efficient tuning order automatically. Afterwards, we demonstrate the applicability and scalability of our approach with reproducible examples.