BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dba0f599911
DTSTART;TZID=America/Toronto:20181212T121500
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181212T121500
URL:https://uwaterloo.ca/data-systems-group/events/phd-seminar-gal-graph-aw
 are-layout-disk-resident-graph
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:PhD Seminar • GAL: Graph-Aware Layout for Disk-Resident Graph\nDa
 tabases
CLASS:PUBLIC
DESCRIPTION:ZEYNEP KORKMAZ\, PHD CANDIDATE\nDavid R. Cheriton School of Com
 puter Science\n\nAnalysis on graphs have powerful impact on solving many s
 ocial and\nscientific problems\, and applications often perform expensive\
 ntraversals on large scale graphs. Caching approaches on top  of\npersist
 ent storage are among the classical solutions to handle high\nrequest thro
 ughput. However\, graph processing applications have poor\naccess locality
 \, and caching algorithms do not improve disk I/O\nsufficiently. We presen
 t GAL\, a graph-aware layout for disk-resident\ngraph databases that gener
 ates a storage layout for large-scale graphs\non disk with the objective o
 f increasing locality of disk blocks and\nreducing the number of I/O opera
 tions for transactional workloads.
DTSTAMP:20260412T134109Z
END:VEVENT
END:VCALENDAR