default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Halfpap
Person information
- affiliation: Hasso-Plattner-Institut, Potsdam, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Stefan Halfpap:
Integer linear programming-based heuristics for partially replicated database clusters and selecting indexes. University of Potsdam, Germany, 2024- [j2]Stefan Halfpap, Jan Kossmann, Rainer Schlosser, Volker Markl:
Looking Deeply into the Magic Mirror: An Interactive Analysis of Database Index Selection Approaches. Proc. VLDB Endow. 17(12): 4301-4304 (2024) - 2023
- [c20]Peter A. Boncz, Yannis Chronis, Jan Finis, Stefan Halfpap, Viktor Leis, Thomas Neumann, Anisoara Nica, Caetano Sauer, Knut Stolze, Marcin Zukowski:
SPA: Economical and Workload-Driven Indexing for Data Analytics in the Cloud. ICDE 2023: 3740-3746 - [c19]Stefan Halfpap
:
Hybrid Index Selection Using Integer Linear Programming Based on Cached Cost Estimates of Heuristic Approaches. SiMoD@SIGMOD 2023: 5:1-5:4 - 2021
- [c18]Rainer Schlosser, Stefan Halfpap:
Robust and Memory-Efficient Database Fragment Allocation for Large and Uncertain Database Workloads. EDBT 2021: 367-372 - [c17]Stefan Halfpap, Rainer Schlosser:
Memory-Efficient Database Fragment Allocation for Robust Load Balancing when Nodes Fail. ICDE 2021: 1811-1816 - 2020
- [j1]Jan Kossmann, Stefan Halfpap, Marcel Jankrift, Rainer Schlosser:
Magic mirror in my hand, which is the best in the land? An Experimental Evaluation of Index Selection Algorithms. Proc. VLDB Endow. 13(11): 2382-2395 (2020) - [c16]Stefan Halfpap, Rainer Schlosser:
Exploration of Dynamic Query-Based Load Balancing for Partially Replicated Database Systems with Node Failures. CIKM 2020: 3409-3412 - [c15]Rainer Schlosser, Stefan Halfpap:
A Decomposition Approach for Risk-Averse Index Selection. SSDBM 2020: 16:1-16:4
2010 – 2019
- 2019
- [c14]Stefan Klauck, Max Plauth, Sven Knebel, Marius Strobl, Douglas Santry, Lars Eggert:
Eliminating the Bandwidth Bottleneck of Central Query Dispatching Through TCP Connection Hand-Over. BTW 2019: 97-106 - [c13]Markus Dreseler, Jan Kossmann, Martin Boissier, Stefan Klauck, Matthias Uflacker, Hasso Plattner:
Hyrise Re-engineered: An Extensible Database System for Research in Relational In-Memory Data Management. EDBT 2019: 313-324 - [c12]Stefan Halfpap, Rainer Schlosser:
Workload-Driven Fragment Allocation for Partially Replicated Databases Using Linear Programming. ICDE 2019: 1746-1749 - [c11]Stefan Halfpap, Rainer Schlosser:
A Comparison of Allocation Algorithms for Partially Replicated Databases. ICDE 2019: 2008-2011 - [c10]Stefan Halfpap:
Efficient Scale-Out Using Query-Driven Workload Distribution and Fragment Allocation. PhD@VLDB 2019 - 2018
- [c9]Jens Hiller, Maël Kimmerlin, Max Plauth, Seppo Heikkilä, Stefan Klauck, Ville Lindfors, Felix Eberhardt, Dariusz Bursztynowski, Jesus Llorente Santos, Oliver Hohlfeld, Klaus Wehrle:
Giving Customers Control Over Their Data: Integrating a Policy Language into the Cloud. IC2E 2018: 241-249 - 2015
- [c8]Lars Butzmann, Stefan Klauck, Stephan Müller, Matthias Uflacker, Werner Sinzig, Hasso Plattner:
Generic Business Simulation Using an In-Memory Column Store. BTW 2015: 633-643 - [c7]Stefan Klauck, Lars Butzmann, Stephan Müller, Martin Faust, David Schwalb, Matthias Uflacker, Werner Sinzig, Hasso Plattner:
Interactive, Flexible, and Generic What-If Analyses Using In-Memory Column Stores. DASFAA (2) 2015: 488-497 - [c6]Stephan Müller, Anisoara Nica, Lars Butzmann, Stefan Klauck, Hasso Plattner:
Using Object-Awareness to Optimize Join Processing in the SAP HANA Aggregate Cache. EDBT 2015: 557-568 - [c5]David Schwalb, Jan Kossmann, Martin Faust, Stefan Klauck, Matthias Uflacker, Hasso Plattner:
Hyrise-R: Scale-out and Hot-Standby through Lazy Master Replication for Enterprise Applications. IMDM@VLDB 2015: 7:1-7:7 - 2014
- [c4]Stephan Müller, Lars Butzmann, Stefan Klauck, Hasso Plattner:
An Adaptive Aggregate Maintenance Approach for Mixed Workloads in Columnar In-Memory Databases. ACSC 2014: 3-12 - 2013
- [c3]Stephan Müller, Lars Butzmann, Stefan Klauck, Hasso Plattner:
Workload-aware aggregate maintenance in columnar in-memory databases. IEEE BigData 2013: 62-69 - [c2]Stephan Müller, Lars Butzmann, Kai Hoewelmeyer, Stefan Klauck, Hasso Plattner:
Efficient View Maintenance for Enterprise Applications in Columnar In-Memory Databases. EDOC 2013: 249-258 - 2011
- [c1]Christian Tinnefeld, Stephan Müller, Helen Kaltegärtner, Sebastian Hillig, Lars Butzmann, David Eickhoff, Stefan Klauck, Daniel Taschik, Björn Wagner, Oliver Xylander, Alexander Zeier, Hasso Plattner, Cafer Tosun:
Available-To-Promise on an In-Memory Column Store. BTW 2011: 667-686
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
