BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181221T160743Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess342_drs101@linklings.com
SUMMARY:Pattern Matching on Massive Metadata Graphs at Scale
DESCRIPTION:Doctoral Showcase\nWorkshop Reg Pass, Tutorial Reg Pass, Tech 
 Program Reg Pass, Exhibits Reg Pass, Exhibits - Exhibit Hall Only Reg Pass
 \n\nPattern Matching on Massive Metadata Graphs at Scale\n\nReza, Ripeanu\
 n\nPattern matching is a powerful graph analysis tool. Unfortunately, exis
 ting solutions have limited scalability, support only a limited set of pat
 terns, and/or focus on only a subset of the real-world problems associated
  with pattern matching. First, we present a new algorithmic pipeline based
  on graph pruning that: (i) enables highly scalable exact pattern matching
  on labeled graphs, (ii) supports arbitrary patterns, (iii) enables trade-
 offs between precision and time-to-solution, and (iv) supports a set of po
 pular analytics scenarios. We implement our approach on top of HavoqGT and
  demonstrate its advantages through strong and weak scaling experiments on
  massive-scale real-world (up to 257B edges) and synthetic (up to 4.4T edg
 es) graphs, respectively, and at scales (1,024 nodes / 36,864 cores) order
 s of magnitude larger than used in the past for similar problems. Furtherm
 ore, we explore avenues to enable approximate matching within the graph pr
 uning model, targeting contemporary and emerging high-impact, real-world a
 pplications.
URL:https://sc18.supercomputing.org/presentation/?id=drs101&sess=sess342
END:VEVENT
END:VCALENDAR

