Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This lecture delves into the analysis of the performance of Log-Structured Merge (LSM) trees, focusing on the trade-offs between write throughput and read speed. The instructor discusses the design choices involved in LSM trees, such as workload characterization, multi-level data structures, and the impact of storage heterogeneity. Various strategies to enhance performance, including thread local arrays and skip-list designs, are explored. Experiments with different setups, like Intel Xeon CPUs and varying cache sizes, are presented to showcase the practical implications of these design decisions. The lecture concludes with insights on leveraging Bloom filters and leveled merges to optimize LSM tree performance.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace