Martin Boissier

Research Assistant, PhD Candidate

	Phone:	+49 (331) 5509 - 1330
	Fax:	+49 (331) 97992 - 579
	E-Mail:	martin.boissier(at)hpi.de
	Website:	https://martin.boissier.de
	Room:	Hasso-Plattner-Villa, V 2.05

Research

Main Memory Footprint Reduction of In-Memory Database Systems

Modern relational database systems keep data resident in main memory. While this enables high runtime performance, the required computational resources also incur a high TCO. It is thus desirable to reduce the main memory footprint while at the same time retaining the performance superiority over disk-based systems. In the spectrum of a fully DRAM-resident to a disk-resident database system, the goal is to find a configuration with the maximum runtime performance for a given memory budget. Existing approaches focus either on analytical or transactional systems. However, for OLxP workloads, such a reduction is an unsolved challenge for which existing methods are insufficient.
We propose methods for OLxP database systems, which degrade gracefully with decreasing memory budgets and adapt dynamically to changing workloads. To estimate a configuration’s impact before actually applying it, we build learned performance estimators that allow us to generate robust configurations.
The actual footprint reduction process is divided into three aspects. First, we reduce existing allocations by removing inefficient secondary indices and applying workload-driven compression configurations. Second, we use hybrid table layouts that evict infrequently accessed data to secondary storage tiers. Third, we employ auxiliary data structures that eliminate most unnecessary accesses to secondary storage. This mitigates the negative effects of tiering data to slower storage tiers.
We show that access patterns often seen in real-world systems allow reducing the footprint significantly with neglectable performance losses. For very small memory budgets, the auxiliary data structures can avoid the majority of accesses to slower storage tiers.

Teaching

Winter term 2019/20
- Develop your own Database
- Bachelor Projekt 2019/20: Autopilot ON: A Cockpit for Self-Driving Databases
Summer term 2019
- Develop your own Database
- Trends and Concepts in the Software Industry II - Enterprise Cloud Platforms

Publications

Boissier, M., Jendruk, M.: Workload-Driven and Robust Selection of Compression Schemes for Column Stores. 22nd International Conference on Extending Database Technology (EDBT). pp. 674-677 (2019).

[ BibTeX ] [ Download ]

@conference{boissier2019workloaddriven, author = {Boissier, Martin and Jendruk, Max}, booktitle = {22nd International Conference on Extending Database Technology (EDBT)}, keywords = {myown hyrise}, month = 3, pages = {674-677}, title = {Workload-Driven and Robust Selection of Compression Schemes for Column Stores}, year = 2019 }
Dreseler, M., Kossmann, J., Boissier, M., Klauck, S., Uflacker, M., Plattner, H.: Hyrise Re-engineered: An Extensible Database System for Research in Relational In-Memory Data Management. 22nd International Conference on Extending Database Technology (EDBT). pp. 313-324 (2019).

[ BibTeX ] [ Download ]

@inproceedings{dreseler2018, author = {Dreseler, Markus and Kossmann, Jan and Boissier, Martin and Klauck, Stefan and Uflacker, Matthias and Plattner, Hasso}, booktitle = {22nd International Conference on Extending Database Technology (EDBT)}, keywords = {myown hyrise}, month = 3, pages = {313-324}, title = {Hyrise Re-engineered: An Extensible Database System for Research in Relational In-Memory Data Management}, year = 2019 }
Schlosser, R., Walther, C., Boissier, M., Uflacker, M.: Automated Repricing and Ordering Strategies in Competitive Markets. AI Communications. 32, 15-29 (2019).

[ Abstract ] [ BibTeX ] [ Download ]

Merchants on modern e-commerce platforms face a highly competitive environments. They compete against each other using automated dynamic pricing and ordering strategies. Successfully managing both inventory levels as well as offer prices is a challenging task as (i) demand is uncertain, (ii) competitors strategically interact, and (iii) optimized pricing and ordering decisions are mutually dependent. We show how to derive optimized data-driven pricing and ordering strategies which are based on demand learning techniques and efficient dynamic optimization models. We verify the superior performance of our self-adaptive strategies by comparing them against different rule-based as well as data-driven strategies in duopoly and oligopoly settings. Further, to study and to optimize joint dynamic ordering and pricing strategies on online marketplaces, we built an interactive simulation platform. To be both flexible and scalable, the platform has a microservice-based architecture and allows handling dozens of competing merchants and streams of consumers with configurable characteristics.

@article{schlosser2019automated, abstract = {Merchants on modern e-commerce platforms face a highly competitive environments. They compete against each other using automated dynamic pricing and ordering strategies. Successfully managing both inventory levels as well as offer prices is a challenging task as (i) demand is uncertain, (ii) competitors strategically interact, and (iii) optimized pricing and ordering decisions are mutually dependent. We show how to derive optimized data-driven pricing and ordering strategies which are based on demand learning techniques and efficient dynamic optimization models. We verify the superior performance of our self-adaptive strategies by comparing them against different rule-based as well as data-driven strategies in duopoly and oligopoly settings. Further, to study and to optimize joint dynamic ordering and pricing strategies on online marketplaces, we built an interactive simulation platform. To be both flexible and scalable, the platform has a microservice-based architecture and allows handling dozens of competing merchants and streams of consumers with configurable characteristics.}, author = {Schlosser, Rainer and Walther, Carsten and Boissier, Martin and Uflacker, Matthias}, journal = {AI Communications}, keywords = {myown ordering pricing}, pages = {15-29}, title = {Automated Repricing and Ordering Strategies in Competitive Markets}, volume = 32, year = 2019 }
Schlosser, R., Kossmann, J., Boissier, M.: Efficient Scalable Multi-Attribute Index Selection Using Recursive Strategies. IEEE 35th International Conference on Data Engineering (ICDE 2019). pp. 1238-1249. IEEE (2019).

[ BibTeX ] [ Download ]

@conference{schlosser2019efficient, author = {Schlosser, Rainer and Kossmann, Jan and Boissier, Martin}, booktitle = {IEEE 35th International Conference on Data Engineering (ICDE 2019)}, keywords = {myown}, month = {apr}, pages = {1238-1249}, publisher = {IEEE}, title = {Efficient Scalable Multi-Attribute Index Selection Using Recursive Strategies}, year = 2019 }
Boissier, M.: Reducing the Footprint of Main Memory HTAP Systems: Removing, Compressing, Tiering, and Ignoring Data. PhD Workshop at VLDB. CEUR-WS.org (2018).

[ Abstract ] [ BibTeX ] [ Download ]

Gracefully reducing the main memory footprint (e.g., via compression and data tiering) is an unsolved challenge for HTAP database systems, where most traditional reduction methods are no longer applicable. Since advantages of a reduced footprint are manyfold, the issue is of high importance for main memory-resident databases. In this paper, we present our work on Hyrise and discuss how we break down this challenge into three aspects in order to reduce the main memory consumption without losing the performance advantage of in-memory databases. First, we reduce existing allocations by efficiently selecting indices and workload-driven compression configurations for table data. Second, we use hybrid table layouts to tier data with minimal impacts on the runtime performance. Third, we employ data structures that efficiently eliminate unnecessary accesses to secondary storage. As an outlook, we depict our vision to eventually unite these aspects in a holistic footprint optimization.

@inproceedings{DBLP:conf/vldb/Boissier18, abstract = {Gracefully reducing the main memory footprint (e.g., via compression and data tiering) is an unsolved challenge for HTAP database systems, where most traditional reduction methods are no longer applicable. Since advantages of a reduced footprint are manyfold, the issue is of high importance for main memory-resident databases. In this paper, we present our work on Hyrise and discuss how we break down this challenge into three aspects in order to reduce the main memory consumption without losing the performance advantage of in-memory databases. First, we reduce existing allocations by efficiently selecting indices and workload-driven compression configurations for table data. Second, we use hybrid table layouts to tier data with minimal impacts on the runtime performance. Third, we employ data structures that efficiently eliminate unnecessary accesses to secondary storage. As an outlook, we depict our vision to eventually unite these aspects in a holistic footprint optimization.}, author = {Boissier, Martin}, booktitle = {PhD Workshop at VLDB}, keywords = {myown}, month = 8, publisher = {CEUR-WS.org}, series = {{CEUR} Workshop Proceedings}, title = {Reducing the Footprint of Main Memory HTAP Systems: Removing, Compressing, Tiering, and Ignoring Data}, volume = 2175, year = 2018 }
Schlosser, R., Boissier, M.: Dealing with the Dimensionality Curse in Dynamic Pricing Competition: Using Frequent Repricing to Compensate Imperfect Market Anticipations. Computers and Operations Research. 100, 26-42 (2018).

[ Abstract ] [ BibTeX ] [ Download ]

Most sales applications are characterized by competition and limited demand information. For success- ful pricing strategies, frequent price adjustments as well as anticipation of market dynamics are crucial. Both effects are challenging as competitive markets are complex and computations of optimized pricing adjustments can be time-consuming. We analyze stochastic dynamic pricing models under oligopoly competition for the sale of perishable goods. To circumvent the curse of dimensionality, we propose a heuristic approach to efficiently compute price adjustments. To demonstrate our strategy’s applicability even if the number of competitors is large and their strategies are unknown, we consider different competitive settings in which competitors frequently and strategically adjust their prices. For all settings, we verify that our heuristic strategy yields promising results. We compare the performance of our heuristic against upper bounds, which are obtained by optimal strategies that take advantage of perfect price an- ticipations. We find that price adjustment frequencies can have a larger impact on expected profits than price anticipations. Finally, our approach has been applied on Amazon for the sale of used books. We have used a seller’s historical market data to calibrate our model. Sales results show that our data-driven strategy outperforms the rule-based strategy of an experienced seller by a profit increase of more than 20%.

@article{schlosser2018dealing, abstract = {Most sales applications are characterized by competition and limited demand information. For success- ful pricing strategies, frequent price adjustments as well as anticipation of market dynamics are crucial. Both effects are challenging as competitive markets are complex and computations of optimized pricing adjustments can be time-consuming. We analyze stochastic dynamic pricing models under oligopoly competition for the sale of perishable goods. To circumvent the curse of dimensionality, we propose a heuristic approach to efficiently compute price adjustments. To demonstrate our strategy’s applicability even if the number of competitors is large and their strategies are unknown, we consider different competitive settings in which competitors frequently and strategically adjust their prices. For all settings, we verify that our heuristic strategy yields promising results. We compare the performance of our heuristic against upper bounds, which are obtained by optimal strategies that take advantage of perfect price an- ticipations. We find that price adjustment frequencies can have a larger impact on expected profits than price anticipations. Finally, our approach has been applied on Amazon for the sale of used books. We have used a seller’s historical market data to calibrate our model. Sales results show that our data-driven strategy outperforms the rule-based strategy of an experienced seller by a profit increase of more than 20%.}, author = {Schlosser, Rainer and Boissier, Martin}, journal = {Computers and Operations Research}, keywords = {myown competition pricing}, pages = {26-42}, title = {Dealing with the Dimensionality Curse in Dynamic Pricing Competition: Using Frequent Repricing to Compensate Imperfect Market Anticipations}, volume = 100, year = 2018 }
Ruhrländer, R.P., Boissier, M., Uflacker, M.: Improving Box Office Result Predictions for Movies Using Consumer-Centric Models. KDD '18 Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. pp. 655-664 (2018).

[ Abstract ] [ BibTeX ] [ Download ]

Recent progress in machine learning and related fields like recommender systems open up new possibilities for data-driven approaches. One example is the prediction of a movie’s box office revenue, which is highly relevant for optimizing production and marketing. We use individual recommendations and user-based forecast models in a system that forecasts revenue and additionally provides actionable insights for industry professionals. In contrast to most existing models that completely neglect user preferences, our approach allows us to model the most important source for movie success: moviegoer taste and behavior. We divide the problem into three distinct stages: (i) we use matrix factorization recommenders to model each user’s taste, (ii) we then predict the individual consumption behavior, and (iii) eventually aggregate users to predict the box office result. We compare our approach to the current industry standard and show that the inclusion of user rating data reduces the error by a factor of 2x and outperforms recently published research.

@inproceedings{ruhrlander2018improving, abstract = {Recent progress in machine learning and related fields like recommender systems open up new possibilities for data-driven approaches. One example is the prediction of a movie’s box office revenue, which is highly relevant for optimizing production and marketing. We use individual recommendations and user-based forecast models in a system that forecasts revenue and additionally provides actionable insights for industry professionals. In contrast to most existing models that completely neglect user preferences, our approach allows us to model the most important source for movie success: moviegoer taste and behavior. We divide the problem into three distinct stages: (i) we use matrix factorization recommenders to model each user’s taste, (ii) we then predict the individual consumption behavior, and (iii) eventually aggregate users to predict the box office result. We compare our approach to the current industry standard and show that the inclusion of user rating data reduces the error by a factor of 2x and outperforms recently published research.}, author = {Ruhrländer, Rui Paulo and Boissier, Martin and Uflacker, Matthias}, booktitle = {{KDD} '18 Proceedings of the 24th {ACM} {SIGKDD} International Conference on Knowledge Discovery & Data Mining}, keywords = {myown}, pages = {655-664}, title = {Improving Box Office Result Predictions for Movies Using Consumer-Centric Models}, year = 2018 }
Schlosser, R., Boissier, M.: Dynamic Pricing under Competition on Online Marketplaces: A Data-Driven Approach. KDD '18 Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. pp. 705-714 (2018).

[ Abstract ] [ BibTeX ] [ Download ]

Most online markets are characterized by competitive settings and limited demand information. Due to the complexity of such markets, efficient pricing strategies are hard to derive. We analyze stochastic dynamic pricing models in competitive markets with multiple offer dimensions, such as price, quality, and rating. In a first step, we use a simulated test market to study how sales probabilities are affected by specific customer behaviors and the strategic interaction of price reaction strategies. Further, we show how different state-of-the-art learning techniques can be used to estimate sales probabilities from partially observable market data. In a second step, we use a dynamic programming model to compute an effective pricing strategy which circumvents the curse of dimensionality. We demonstrate that the strategy is applicable even if the number of competitors is large and their strategies are unknown. We show that our heuristic can be tuned to smoothly balance profitability and speed of sales. Further, our approach is currently applied by a large seller on Amazon for the sale of used books. Sales results show that our data-driven strategy outperforms the rule-based strategy of an experienced seller by a profit increase of more than 20%.

@inproceedings{schlosser2018dynamic, abstract = {Most online markets are characterized by competitive settings and limited demand information. Due to the complexity of such markets, efficient pricing strategies are hard to derive. We analyze stochastic dynamic pricing models in competitive markets with multiple offer dimensions, such as price, quality, and rating. In a first step, we use a simulated test market to study how sales probabilities are affected by specific customer behaviors and the strategic interaction of price reaction strategies. Further, we show how different state-of-the-art learning techniques can be used to estimate sales probabilities from partially observable market data. In a second step, we use a dynamic programming model to compute an effective pricing strategy which circumvents the curse of dimensionality. We demonstrate that the strategy is applicable even if the number of competitors is large and their strategies are unknown. We show that our heuristic can be tuned to smoothly balance profitability and speed of sales. Further, our approach is currently applied by a large seller on Amazon for the sale of used books. Sales results show that our data-driven strategy outperforms the rule-based strategy of an experienced seller by a profit increase of more than 20%.}, author = {Schlosser, Rainer and Boissier, Martin}, booktitle = {{KDD} '18 Proceedings of the 24th {ACM} {SIGKDD} International Conference on Knowledge Discovery & Data Mining}, keywords = {myown competition pricing}, pages = {705-714}, title = {Dynamic Pricing under Competition on Online Marketplaces: A Data-Driven Approach}, year = 2018 }
Schlosser, R., Walther, C., Boissier, M., Uflacker, M.: Data-Driven Inventory Management and Dynamic Pricing Competition on Online Marketplaces. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2018). pp. 5856-5858 (2018).

[ BibTeX ] [ Download ]

@inproceedings{schlosser2018datadriven, author = {Schlosser, Rainer and Walther, Carsten and Boissier, Martin and Uflacker, Matthias}, booktitle = {Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2018)}, keywords = {myown ordering pricewars pricing}, pages = {5856-5858}, title = {Data-Driven Inventory Management and Dynamic Pricing Competition on Online Marketplaces}, year = 2018 }
Boissier, M., Kurzynski, D.: Workload-Driven Horizontal Partitioning and Partition Pruning for Large HTAP Systems. 2018 IEEE 34th International Conference on Data Engineering Workshops. pp. 116-121 (2018).

[ Abstract ] [ BibTeX ] [ Download ]

Modern server systems with large NUMA architectures necessitate (i) data being distributed over the available computing nodes and (ii) NUMA-aware query processing to enable effective parallel processing in database systems. As these architectures incur significant latency and throughout penalties for accessing non-local data, queries should be executed as close as possible to the data. To further increase both performance and efficiency, data that is not relevant for the query result should be skipped as early as possible. One way to achieve this goal is horizontal partitioning to improve static partition pruning. As part of our ongoing work on workload-driven partitioning, we have implemented a recent approach called aggressive data skipping and extended it to handle both analytical as well as transactional access patterns. In this paper, we evaluate this approach with the workload and data of a production enterprise system of a Global 2000 company. The results show that over 80% of all tuples can be skipped in average while the resulting partitioning schemata are surprisingly stable over time.

@inproceedings{boissier2018workloaddriven, abstract = {Modern server systems with large NUMA architectures necessitate (i) data being distributed over the available computing nodes and (ii) NUMA-aware query processing to enable effective parallel processing in database systems. As these architectures incur significant latency and throughout penalties for accessing non-local data, queries should be executed as close as possible to the data. To further increase both performance and efficiency, data that is not relevant for the query result should be skipped as early as possible. One way to achieve this goal is horizontal partitioning to improve static partition pruning. As part of our ongoing work on workload-driven partitioning, we have implemented a recent approach called aggressive data skipping and extended it to handle both analytical as well as transactional access patterns. In this paper, we evaluate this approach with the workload and data of a production enterprise system of a Global 2000 company. The results show that over 80% of all tuples can be skipped in average while the resulting partitioning schemata are surprisingly stable over time.}, author = {Boissier, Martin and Kurzynski, Daniel}, booktitle = {2018 IEEE 34th International Conference on Data Engineering Workshops}, keywords = {myown}, month = 4, pages = {116-121}, title = {Workload-Driven Horizontal Partitioning and Partition Pruning for Large HTAP Systems}, year = 2018 }
Boissier, M., Schlosser, R., Uflacker, M.: Hybrid Data Layouts for Tiered HTAP Databases with Pareto-Optimal Data Placements. IEEE 34th International Conference on Data Engineering (ICDE 2018). pp. 209-220 (2018).

[ Abstract ] [ BibTeX ] [ Download ]

Recent developments in database research intro- duced HTAP systems that are capable of handling both transactional and analytical workloads. These systems achieve their performance by storing the full data set in main memory. An open research question is how far one can reduce the main memory footprint without losing the performance superiority of main memory-resident databases. In this paper, we present a hybrid main memory-optimized database for mixed workloads that evicts cold data to less expensive storage tiers. It adapts the storage layout to mitigate the negative performance impact of secondary storage. A key challenge is to determine which data to place on which storage tier. We introduce a novel workload-driven model that determines Pareto-optimal allocations while also considering reallocation costs. We evaluate our concept for a production enterprise system as well as reproducible data sets.

@inproceedings{boissier2018hybrid, abstract = {Recent developments in database research intro- duced HTAP systems that are capable of handling both transactional and analytical workloads. These systems achieve their performance by storing the full data set in main memory. An open research question is how far one can reduce the main memory footprint without losing the performance superiority of main memory-resident databases. In this paper, we present a hybrid main memory-optimized database for mixed workloads that evicts cold data to less expensive storage tiers. It adapts the storage layout to mitigate the negative performance impact of secondary storage. A key challenge is to determine which data to place on which storage tier. We introduce a novel workload-driven model that determines Pareto-optimal allocations while also considering reallocation costs. We evaluate our concept for a production enterprise system as well as reproducible data sets.}, author = {Boissier, Martin and Schlosser, Rainer and Uflacker, Matthias}, booktitle = {IEEE 34th International Conference on Data Engineering (ICDE 2018)}, keywords = {myown uncompressed column}, month = 4, pages = {209-220}, title = {Hybrid Data Layouts for Tiered HTAP Databases with Pareto-Optimal Data Placements}, year = 2018 }
Schlosser, R., Boissier, M.: Optimal Repricing Strategies in a Stochastic Infinite Horizon Duopoly. Communications in Computer and Information Science (CCIS). pp. 129-150. Springer (2018).

[ BibTeX ] [ Download ]

@inbook{schlosser2017optimal, author = {Schlosser, Rainer and Boissier, Martin}, booktitle = {Communications in Computer and Information Science (CCIS)}, keywords = {imported myown pricing}, pages = {129-150}, publisher = {Springer}, title = {Optimal Repricing Strategies in a Stochastic Infinite Horizon Duopoly}, volume = 884, year = 2018 }
Boissier, M., Spivak, A., Meyer, C.: Improving Materialization for Tiered Column Stores: A Workload-Aware Ansatz Based on Table Reordering. ACSW '17 Proceedings of the Australasian Computer Science Week Multiconference, ACSW '17. pp. 25:1-25:10. ACM, New York, NY, USA (2017).

[ BibTeX ] [ Download ]

@inproceedings{Martin2017a, address = {New York, NY, USA}, author = {Boissier, Martin and Spivak, Alexander and Meyer, Carsten}, booktitle = {ACSW '17 Proceedings of the Australasian Computer Science Week Multiconference, ACSW '17}, keywords = {imported myown}, month = 1, pages = {25:1-25:10}, publisher = {ACM}, series = {ACSW '17}, title = {Improving Materialization for Tiered Column Stores: A Workload-Aware Ansatz Based on Table Reordering}, year = 2017 }
Zimmermann, T., Djürken, T., Mayer, A., Janke, M., Boissier, M., Schwarz, C., Schlosser, R., Uflacker, M.: Detecting Fraudulent Advertisements on a Large E-Commerce Platform. Proceedings of the Nineteenth International Workshop on Data Warehousing and OLAP, DOLAP, Venice, Italy, March 21, 2017 (2017).

[ BibTeX ] [ Download ]

@conference{Tim2017a, author = {Zimmermann, Tim and Djürken, Timo and Mayer, Arne and Janke, Michael and Boissier, Martin and Schwarz, Christian and Schlosser, Rainer and Uflacker, Matthias}, booktitle = {Proceedings of the Nineteenth International Workshop on Data Warehousing and OLAP, DOLAP, Venice, Italy, March 21, 2017.}, keywords = {imported}, month = 3, title = {Detecting Fraudulent Advertisements on a Large E-Commerce Platform}, year = 2017 }
Boissier, M., Schlosser, R., Podlesny, N., Serth, S., Bornstein, M., Latt, J., Lindemann, J., Selke, J., Uflacker, M.: Data-Driven Repricing Strategies in Competitive Markets: An Interactive Simulation Platform. Proceedings of the Eleventh ACM Conference on Recommender Systems (RecSys '17). pp. 355-357. ACM, New York, NY, USA (2017).

[ BibTeX ] [ Download ]

@inproceedings{recsysdemo2017dynpri, address = {New York, NY, USA}, author = {Boissier, Martin and Schlosser, Rainer and Podlesny, Nikolai and Serth, Sebastian and Bornstein, Marvin and Latt, Johanna and Lindemann, Jan and Selke, Jan and Uflacker, Matthias}, booktitle = {Proceedings of the Eleventh ACM Conference on Recommender Systems (RecSys '17)}, keywords = {myown Dynamic Pricing RecSys Recommender pricewars Systems Demonstration}, month = 10, pages = {355-357}, publisher = {ACM}, series = {RecSys '17}, title = {Data-Driven Repricing Strategies in Competitive Markets: An Interactive Simulation Platform}, year = 2017 }
Serth, S., Podlesny, N., Bornstein, M., Lindemann, J., Latt, J., Selke, J., Schlosser, R., Boissier, M., Uflacker, M.: An Interactive Platform to Simulate Dynamic Pricing Competition on Online Marketplaces. 21st IEEE International Enterprise Distributed Object Computing Conference, EDOC 2017, Quebec City, QC, Canada, October 10-13, 2017. pp. 61-66. IEEE (2017).

[ BibTeX ] [ Download ]

@inproceedings{edoc2017pricewars, author = {Serth, Sebastian and Podlesny, Nikolai and Bornstein, Marvin and Lindemann, Jan and Latt, Johanna and Selke, Jan and Schlosser, Rainer and Boissier, Martin and Uflacker, Matthias}, booktitle = {21st IEEE International Enterprise Distributed Object Computing Conference, EDOC 2017, Quebec City, QC, Canada, October 10-13, 2017}, keywords = {myown price pricewars dynamic wars pricing platform}, month = 10, pages = {61-66}, publisher = {IEEE}, title = {An Interactive Platform to Simulate Dynamic Pricing Competition on Online Marketplaces}, year = 2017 }
Schlosser, R., Boissier, M.: Optimal Price Reaction Strategies in the Presence of Active and Passive Competitors. Proceedings of the 6th International Conference on Operations Research and Enterprise Systems (ICORES), Porto, Portugal. pp. 47-56 (2017).

[ BibTeX ] [ Download ]

@inproceedings{Rainer2017a, author = {Schlosser, Rainer and Boissier, Martin}, booktitle = {Proceedings of the 6th International Conference on Operations Research and Enterprise Systems (ICORES), Porto, Portugal}, keywords = {imported pricewars pricing}, month = 2, pages = {47-56}, title = {Optimal Price Reaction Strategies in the Presence of Active and Passive Competitors}, year = 2017 }
Schlosser, R., Boissier, M., Schober, A., Uflacker, M.: How To Survive Dynamic Pricing Competition in E-commerce. Proceedings of the Poster Track of the 10th ACM Conference on Recommender Systems (RecSys 2016), Boston, USA, September 17, 2016 (2016).

[ BibTeX ] [ Download ]

@conference{Rainer2016a, author = {Schlosser, Rainer and Boissier, Martin and Schober, Andre and Uflacker, Matthias}, booktitle = {Proceedings of the Poster Track of the 10th {ACM} Conference on Recommender Systems (RecSys 2016), Boston, USA, September 17, 2016}, keywords = {imported amazon pricewars pricing}, month = 9, title = {How To Survive Dynamic Pricing Competition in E-commerce}, year = 2016 }
Boissier, M., Meyer, C., Djürken, T., Lindemann, J., Mao, K., Reinhardt, P., Specht, T., Zimmermann, T., Uflacker, M.: Analyzing Data Relevance and Access Patterns of Live Production Database Systems. Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, CIKM 2016. p. 2473--2475. ACM, New York, NY, USA (2016).

[ BibTeX ] [ Download ]

@conference{Martin2016b, address = {New York, NY, USA}, author = {Boissier, Martin and Meyer, Carsten and Djürken, Timo and Lindemann, Jan and Mao, Kathrin and Reinhardt, Pascal and Specht, Tim and Zimmermann, Tim and Uflacker, Matthias}, booktitle = {Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, CIKM 2016}, keywords = {imported myown}, month = 10, pages = {2473--2475}, publisher = {ACM}, series = {CIKM '16}, title = {Analyzing Data Relevance and Access Patterns of Live Production Database Systems}, year = 2016 }
Faust, M., Boissier, M., Keller, M., Schwalb, D., Bischoff, H., Eisenreich, K., Färber, F., Plattner, H.: Footprint Reduction and Uniqueness Enforcement with Hash Indices in SAP HANA. Database and Expert Systems Applications: 27th International Conference, DEXA 2016, Porto, Portugal, September 5-8, 2016, Proceedings, Part II. p. 137--151 (2016).

[ BibTeX ] [ Download ]

@inbook{Martin2016a, author = {Faust, Martin and Boissier, Martin and Keller, Marvin and Schwalb, David and Bischoff, Holger and Eisenreich, Katrin and Färber, Franz and Plattner, Hasso}, booktitle = {Database and Expert Systems Applications: 27th International Conference, DEXA 2016, Porto, Portugal, September 5-8, 2016, Proceedings, Part II}, keywords = {imported}, month = 9, pages = {137--151}, series = {Database and Expert Systems Applications: 27th International Conference, DEXA 2016, Porto, Portugal, September 5-8, 2016, Proceedings, Part II}, title = {Footprint Reduction and Uniqueness Enforcement with Hash Indices in SAP HANA}, year = 2016 }
Boissier, M., Djürken, T., Schlosser, R., Faust, M.: A Cost-Aware and Workload-Based Index Advisor for Columnar In-Memory Databases. 22nd International Conference, ICIST 2016, Druskininkai, Lithuania, October 13-15, 2016, Proceedings, CCIS 639. p. 285--299 (2016).

[ BibTeX ] [ Download ]

@conference{Martin2016a, author = {Boissier, Martin and Djürken, Timo and Schlosser, Rainer and Faust, Martin}, booktitle = {22nd International Conference, {ICIST} 2016, Druskininkai, Lithuania, October 13-15, 2016, Proceedings, {CCIS} 639}, keywords = {imported}, month = 10, pages = {285--299}, title = {A Cost-Aware and Workload-Based Index Advisor for Columnar In-Memory Databases}, year = 2016 }
Boissier, M., Meyer, C., Uflacker, M., Tinnefeld, C.: And all of a sudden: Main Memory Is Less Expensive Than Disk. In: Rabl, T., Sachs, K., Poess, M., K. Baru, C., and Jacobsen, H.-A. (eds.) Big Data Benchmarking. pp. 132-144. Springer International Publishing (2015).

[ BibTeX ] [ Download ]

@inbook{Martin2015a, author = {Boissier, Martin and Meyer, Carsten and Uflacker, Matthias and Tinnefeld, Christian}, booktitle = {Big Data Benchmarking, 5th International Workshop, WBDB 2014, Potsdam, Germany, August 5-6-2014, Revised Selected Papers}, edition = 1, editor = {Rabl, Tilmann and Sachs, Kai and Poess, Meikel and K. Baru, Chaitanya and Jacobsen, Hans-Arno}, journal = {Big Data Benchmarking}, keywords = {Bandwidth In-Memory_Systems Mixed_Workload TCO}, month = 3, number = 1, organization = {Springer International Publishing Switzerland}, pages = {132-144}, publisher = {Springer International Publishing}, series = {Information Systems and Applications, incl. Internet/Web, and HCI}, title = {And all of a sudden: Main Memory Is Less Expensive Than Disk}, volume = 8991, year = 2015 }
Meyer, C., Boissier, M., Michaud, A., Vollmer, J.O., Taylor, K., Schwalb, D., Uflacker, M., Roedszus, K.: Dynamic and Transparent Data Tiering for In-Memory Databases in Mixed Workload Environments. International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures - ADMS @ VLDB 2015 (2015).

[ BibTeX ] [ Download ]

@conference{Carsten2015a, author = {Meyer, Carsten and Boissier, Martin and Michaud, Adrian and Vollmer, Jan Ole and Taylor, Ken and Schwalb, David and Uflacker, Matthias and Roedszus, Kurt}, booktitle = {International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures - ADMS @ VLDB 2015}, keywords = {Data_Aging Data_Tiering EMT EMC Mixed_Workload Main_Memory}, month = 8, title = {Dynamic and Transparent Data Tiering for In-Memory Databases in Mixed Workload Environments}, year = 2015 }
Boissier, M.: Optimizing Main Memory Utilization of Columnar In-Memory Databases Using Data Eviction. Proceedings of Phd Workshop @ VLDB 2014, Hangzhou (2014).

[ BibTeX ] [ Download ]

@conference{Martin2014a, author = {Boissier, Martin}, booktitle = {Proceedings of Phd Workshop @ VLDB 2014, Hangzhou}, keywords = {imported}, month = 9, title = {Optimizing Main Memory Utilization of Columnar In-Memory Databases Using Data Eviction}, year = 2014 }
Boissier, M., Krüger, J., Wust, J., Plattner, H.: An Integrated Data Management for Enterprise Systems. ICEIS 2014 - Proceedings of the 16th International Conference on Enterprise Information Systems. pp. 410-418 (2014).

[ BibTeX ] [ Download ]

@conference{Martin2014a, author = {Boissier, Martin and Krüger, Jens and Wust, Johannes and Plattner, Hasso}, booktitle = {ICEIS 2014 - Proceedings of the 16th International Conference on Enterprise Information Systems}, journal = {ICEIS 2014 - Proceedings of the 16th International Conference on Enterprise Information Systems}, keywords = {imported myown}, pages = {410-418}, title = {An Integrated Data Management for Enterprise Systems}, volume = 3, year = 2014 }
Krüger, J., Hübner, F., Wust, J., Boissier, M., Zeier, A., Plattner, H.: Main Memory Databases for Enterprise Applications. IEEE 18Th International Conference on Industrial Engineering and Engineering Management (IE&EM), 2011 (2011).

[ BibTeX ] [ Download ]

@conference{Jens2011a, author = {Krüger, Jens and Hübner, Florian and Wust, Johannes and Boissier, Martin and Zeier, Alexander and Plattner, Hasso}, booktitle = {IEEE 18Th International Conference on Industrial Engineering and Engineering Management (IE&EM), 2011}, keywords = {imported}, title = {Main Memory Databases for Enterprise Applications}, year = 2011 }
Krüger, J., Grund, M., Boissier, M., Zeier, A., Plattner, H.: Data Structures for Mixed Workloads in In-Memory Databases. 5th International Conference on Computer Sciences and Convergence Information Technology (ICCIT), 2010 (2010).

[ BibTeX ] [ Download ]

@conference{Jens2010a, author = {Krüger, Jens and Grund, Martin and Boissier, Martin and Zeier, Alexander and Plattner, Hasso}, booktitle = {5th International Conference on Computer Sciences and Convergence Information Technology (ICCIT), 2010}, keywords = {imported}, title = {Data Structures for Mixed Workloads in In-Memory Databases}, year = 2010 }