Thomas Willhalm

44 papers A* 1A 5C 5Journal 15Unranked 17

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Exploiting Locality in Flat Memory with CXL for In-Memory Database Management Systems. DaMoN Minseon Ahn, Thomas Willhalm, Donghun Lee, Norman May, Jungmin Kim, Daniel Ritter, Oliver Rebholz
2024	J	`jnl`	An Examination of CXL Memory Use Cases for In-Memory Database Management Systems using SAP HANA. Proc. VLDB Endow. Minseon Ahn, Thomas Willhalm, Norman May, Donghun Lee, Suprasad Mutalik Desai, Daniel Booss, Jungmin Kim, Navneet Singh, Daniel Ritter, Oliver Rebholz
2023	—	`conf`	CXL Memory as Persistent Memory for Disaggregated HPC: A Practical Approach. SC Workshops Yehonatan Fridman, Suprasad Mutalik Desai, Navneet Singh, Thomas Willhalm, Gal Oren
2023	J	`jnl`	CXL Memory as Persistent Memory for Disaggregated HPC: A Practical Approach. CoRR Yehonatan Fridman, Suprasad Mutalik Desai, Navneet Singh, Thomas Willhalm, Gal Oren
2023	C	`conf`	Elastic Use of Far Memory for In-Memory Database Management Systems. DaMoN Donghun Lee, Thomas Willhalm, Minseon Ahn, Suprasad Mutalik Desai, Daniel Booss, Navneet Singh, Daniel Ritter, Jungmin Kim, Oliver Rebholz
2023	—	`conf`	Near to Far: An Evaluation of Disaggregated Memory for In-Memory Data Processing. DIMES@SOSP Andreas Geyer, Johannes Pietrzyk, Alexander Krause, Dirk Habich, Wolfgang Lehner, Christian Färber, Thomas Willhalm
2020	J	`jnl`	Efficient compute node-local replication mechanisms for NVRAM-centric data structures. VLDB J. Mikhail Zarubin, Thomas Kissinger, Dirk Habich, Thomas Willhalm, Wolfgang Lehner
2019	J	`jnl`	Evaluating Persistent Memory Range Indexes. Proc. VLDB Endow. Lucas Lersch, Xiangpeng Hao, Ismail Oukid, Tianzheng Wang, Thomas Willhalm
2019	C	`conf`	Integer Compression in NVRAM-centric Data Stores: Comparative Experimental Analysis to DRAM. DaMoN Mikhail Zarubin, Patrick Damme, Thomas Kissinger, Dirk Habich, Wolfgang Lehner, Thomas Willhalm
2017	—	`conf`	Adaptive Recovery for SCM-Enabled Databases. ADMS@VLDB Ismail Oukid, Anisoara Nica, Daniel Dos Santos Bossle, Wolfgang Lehner, Peter Bumbulis, Thomas Willhalm
2017	J	`jnl`	Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems. Proc. VLDB Endow. Ismail Oukid, Daniel Booss, Adrien Lespinasse, Wolfgang Lehner, Thomas Willhalm, Grégoire Gomes
2017	J	`jnl`	SAP HANA Adoption of Non-Volatile Memory. Proc. VLDB Endow. Mihnea Andrei, Christian Lemke, Günter Radestock, Robert Schulze, Carsten Thiel, Rolando Blanco, Akanksha Meghlan, Muhammad Sharique, Sebastian Seifert, Surendra Vishnoi, Daniel Booss, Thomas Peh, Ivan Schreter, Werner Thesing, Mehul Wagle, Thomas Willhalm
2017	J	`jnl`	Storage class memory and databases: Opportunities and challenges. it Inf. Technol. Ismail Oukid, Robert Kettler, Thomas Willhalm
2016	—	`conf`	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory. SIGMOD Conference Ismail Oukid, Johan Lasperas, Anisoara Nica, Thomas Willhalm, Wolfgang Lehner
2015	A*	`conf`	A Simple Model to Quantify the Impact of Memory Latency and Bandwidth on Performance. SIGMETRICS Russell M. Clapp, Martin Dimitrov, Karthik Kumar, Vish Viswanathan, Thomas Willhalm
2015	A	`conf`	Instant Recovery for Main Memory Databases. CIDR Ismail Oukid, Wolfgang Lehner, Thomas Kissinger, Thomas Willhalm, Peter Bumbulis
2015	—	`conf`	Quantifying the Performance Impact of Memory Latency and Bandwidth for Big Data Workloads. IISWC Russell M. Clapp, Martin Dimitrov, Karthik Kumar, Vish Viswanathan, Thomas Willhalm
2014	C	`conf`	SOFORT: a hybrid SCM-DRAM storage engine for fast data recovery. DaMoN Ismail Oukid, Daniel Booss, Wolfgang Lehner, Peter Bumbulis, Thomas Willhalm
2013	—	`conf`	Memory system characterization of big data workloads. IEEE BigData Martin Dimitrov, Karthik Kumar, Patrick Lu, Vish Viswanathan, Thomas Willhalm
2013	—	`conf`	Vectorizing Database Column Scans with Complex Predicates. ADMS@VLDB Thomas Willhalm, Ismail Oukid, Ingo Müller, Franz Faerber
2011	—	`conf`	Fast Sorted-Set Intersection using SIMD Instructions. ADMS@VLDB Benjamin Schlegel, Thomas Willhalm, Wolfgang Lehner
2009	J	`jnl`	SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units. Proc. VLDB Endow. Thomas Willhalm, Nicolae Popovici, Yazan Boshmaf, Hasso Plattner, Alexander Zeier, Jan Schaffner
2008	—	`conf`	Putting intel® threading building blocks to work. IWMSE@ICSE Thomas Willhalm, Nicolae Popovici
2007	A	`conf`	Speed-Up Techniques for Shortest-Path Computations. STACS Dorothea Wagner, Thomas Willhalm
2006	J	`jnl`	Partitioning graphs to speedup Dijkstra's algorithm. ACM J. Exp. Algorithmics Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
2005	J	`jnl`	Combining speed-up techniques for shortest-path computations. ACM J. Exp. Algorithmics Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm
2005	—	`conf`	Drawing Graphs to Speed Up Shortest-Path Computations. ALENEX/ANALCO Dorothea Wagner, Thomas Willhalm
2005	—	`—`	Engineering shortest paths and layout algorithms for large graphs. Thomas Willhalm
2005	J	`jnl`	Geometric containers for efficient shortest-path computation. ACM J. Exp. Algorithmics Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
2005	J	`jnl`	Geometric travel planning. IEEE Trans. Intell. Transp. Syst. Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
2005	—	`conf`	Partitioning Graphs to Speed Up Dijkstra's Algorithm. WEA Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
2004	—	`conf`	Combining Speed-Up Techniques for Shortest-Path Computations. WEA Martin Holzer, Frank Schulz, Thomas Willhalm
2004	J	`jnl`	Generating node coordinates for shortest-path computations in transportation networks. ACM J. Exp. Algorithmics Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
2003	—	`conf`	Accelerating Heuristic Search in Spatial Domains. PuK Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
2003	C	`conf`	Dynamic Shortest Paths Containers. ATMOS Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
2003	A	`conf`	Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. ESA Dorothea Wagner, Thomas Willhalm
2002	—	`conf`	Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor. VisSym Ulrik Brandes, Thomas Willhalm
2001	A	`conf`	Travel Planning with Self-Made Maps. ALENEX Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
2000	J	`jnl`	Dynamic WWW Structures in 3D. J. Graph Algorithms Appl. Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm
2000	J	`jnl`	Reconstructing the Topology of a CAD Model - a Discrete Approach. Algorithmica Karsten Weihe, Thomas Willhalm
1999	—	`conf`	Empirical Design of Geometric Algorithms. SCG Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
1999	—	`conf`	Software Packages. Drawing Graphs Thomas Willhalm
1998	—	`conf`	Why CAD Data Repair Requires Discrete Algorithmic Techniques. WAE Karsten Weihe, Thomas Willhalm
1997	A	`conf`	Reconstructing the Topology of a CAD Model: A Discrete Approach. ESA Karsten Weihe, Thomas Willhalm