| Adopting worst-case optimal joins in relational database systems M Freitag, M Bandle, T Schmidt, A Kemper, T Neumann Proceedings of the VLDB Endowment 13 (12), 1891-1904, 2020 | 90 | 2020 |
| Meet me halfway: split maintenance of continuous views C Winter, T Schmidt, T Neumann, A Kemper Proceedings of the VLDB Endowment 13 (12), 2620-2633, 2020 | 19 | 2020 |
| Predicate caching: Query-driven secondary indexing for cloud data warehouses T Schmidt, A Kipf, D Horn, G Saxena, T Kraska | 8 | 2024 |
| Efficiently Compiling Dynamic Code for Adaptive Query Processing. T Schmidt, P Fent, T Neumann ADMS@ VLDB, 11-22, 2022 | 8 | 2022 |
| Combining worst-case optimal and traditional binary join processing M Freitag, M Bandle, T Schmidt, A Kemper, T Neumann | 7 | 2020 |
| Simple, Efficient, and Robust Hash Tables for Join Processing A Birler, T Schmidt, P Fent, T Neumann Proceedings of the 20th International Workshop on Data Management on New …, 2024 | 4 | 2024 |
| A four-dimensional analysis of partitioned approximate filters T Schmidt, M Bandle, J Giceva Proceedings of the VLDB Endowment 14 (11), 2355-2368, 2021 | 4 | 2021 |
| Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP T Schmidt, D Durner, V Leis, T Neumann Proceedings of the VLDB Endowment 17 (11), 3290-3303, 2024 | 1 | 2024 |
| Adaptive Query Execution: Dynamically Rewriting Compiled Queries T Schmidt Technical University of Munich, 2021 | 1 | 2021 |
| Index-Structures for Worst-Case Optimal Join Algorithms T Schmidt Technical University of Munich, 2019 | | 2019 |
Thomas NeumannProfessor, Technische Universität München在 in.tum.de 的电子邮件经过验证
