BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160210Z
LOCATION:Track 7
DTSTART;TZID=America/New_York:20201119T153000
DTEND;TZID=America/New_York:20201119T160000
UID:submissions.supercomputing.org_SC20_sess294_drs103@linklings.com
SUMMARY:Efficient Metadata Search for Scientific Data
DESCRIPTION:Doctoral Showcase\n\nEfficient Metadata Search for Scientific 
 Data\n\nZhang, Chen, Byna\n\nScientific experiments, observations and simu
 lations often store their datasets in various scientific file formats. Reg
 rettably, to efficiently find the datasets that are interesting to scienti
 sts remains a challenging task due to the diverse characteristics of metad
 ata, the vast number of datasets and the sheer size of the datasets. This 
 research starts with the empirical study that investigates the essentials 
 of the metadata search problem. Aimed at addressing the metadata search ch
 allenges on self-describing data formats, this research further proposes a
  self-contained metadata indexing and querying service that can provide a 
 self-contained DBMS-independent high-performance metadata search experienc
 e to the scientists. Finally, for the metadata search in inter-node settin
 gs, this research addresses the challenge of a distributed metadata search
  by proposing a distributed adaptive radix tree that balances the workload
  while simultaneously supporting efficient metadata search.\n\nRegistratio
 n Category: Tech Program Reg Pass
END:VEVENT
END:VCALENDAR