BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200124T150000
DTEND;TZID=America/Los_Angeles:20200124T160000
DTSTAMP:20261108T023311
CREATED:20200121T095342Z
LAST-MODIFIED:20200124T182021Z
UID:1265-1579878000-1579881600@isg.ics.uci.edu
SUMMARY:LSM-based storage techniques: a tutorial
DESCRIPTION:Speaker: Chen Luo \nAbstract: Recently\, the log-structured merge-tree (LSM-tree) has been widely adopted for use in the storage layer of modern NoSQL systems. Because of this\, there have been a large number of research efforts\, from both the database community and the operating systems community\, that try to improve various aspects of LSM-trees. In this tutorial\, I will describe the basics of LSM-tree storage techniques as well as exploring their design space and performance trade-offs. If time permits\, I will also survey some representative work on optimizing LSM-trees.
URL:https://isg.ics.uci.edu/event/lsm-based-storage-techniques-a-tutorial/
LOCATION:CA
END:VEVENT
END:VCALENDAR