BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Information Systems Group
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:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250502
DTEND;VALUE=DATE:20250503
DTSTAMP:20260419T230100
CREATED:20250401T171841Z
LAST-MODIFIED:20250521T185049Z
UID:2194-1746144000-1746230399@isg.ics.uci.edu
SUMMARY:Yicong Huang: From 100 Applications to 9 Offers: Lessons from the Academic and Industry Job Market
DESCRIPTION:Abstract:\nIn this talk\, I’ll share my personal journey navigating the academic and industry job markets during the 2024–2025 academic year. I’ll reflect on key decisions\, behind-the-scenes experiences\, and the lessons I learned through 100+ applications\, 20+ interviews\, and 9 offers across both domains. Along the way\, I’ll highlight the differences in timelines\, expectations\, and evaluation criteria between academia and industry. This session is intended to be informal\, candid\, and interactive—an honest look at what the job market feels like from the inside. Whether you’re an early-stage Ph.D. student beginning to explore career options\, a researcher actively preparing for the job market\, or someone still deciding between academia and industry\, I hope this talk offers useful insights and encouragement. There’s no single “right” path\, and I’ll share both successes and challenges to help demystify the process for anyone thinking about their next chapter. \nBio:\nYicong Huang is a final-year Ph.D. candidate in the Information Systems Group (ISG)\, Computer Science Department\, University of California\, Irvine. Under the guidance of Dr. Chen Li\, his research focuses on big data management\, data-processing systems\, and machine learning systems. Yicong has made significant contributions to the Texera project. He has published in top-tier database venues such as VLDB\, SIGMOD\, and ICDE. His interdisciplinary reach spans venues like TOCHI\, PNAS Nexus\, JAMIA\, AMIA\, and PLOS ONE. Yicong completed research internships at ByteDance\, VISA\, and Observe\, and contributed to patents and papers. His research earned a Best Demo Runner-Up Award at SIGMOD 2024. He received honors such as the 2025 Joseph & Dorothy Fischer Memorial Endowed Fellowship\, the 2025 Beall Family Foundation Graduate Student Entrepreneur Award in Computer Science\, the 2024 Graduate Dean’s Dissertation Fellowship\, and the 2023 Public Impact Fellowship from UCI. In 2025\, Yicong will join Databricks\, where he will work in the Apache Spark Runtime team. In Fall 2027\, he will begin a faculty appointment as a Tenure-Track Assistant Professor at the Manning College of Information and Computer Sciences (CICS) at UMass Amherst. For more information\, please visit yicong-huang.github.io.
URL:https://isg.ics.uci.edu/event/pat-helland/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250523T130000
DTEND;TZID=America/Los_Angeles:20250523T140000
DTSTAMP:20260419T230100
CREATED:20250401T172015Z
LAST-MODIFIED:20250521T185546Z
UID:2198-1748005200-1748008800@isg.ics.uci.edu
SUMMARY:Binbin Gu: PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification
DESCRIPTION:Abstract:\nAs databases increasingly serve as backbones for sensitive applications\, ensuring both data confidentiality and computational integrity becomes critical—especially when the data owner and querier do not fully trust each other. In this talk\, I will introduce PoneglyphDB\, a novel database system that generates non-interactive zero-knowledge proofs (ZKPs) for arbitrary SQL queries\, allowing users to verify query results without seeing the underlying data. PoneglyphDB tackles key limitations of prior interactive ZKP systems by compiling SQL operators into efficient PLONKish arithmetic circuits\, optimizing them with low-degree polynomial constraints\, recursive proof composition\, and oblivious execution. The system supports a rich set of SQL operations including joins\, aggregations\, group-by\, and even string predicates\, while achieving significant performance improvements over state-of-the-art systems like ZKSQL and Libra. I will detail the system architecture\, circuit compiler\, and experimental results on the TPC-H benchmark\, showing how PoneglyphDB bridges theory and practice for verifiable\, privacy-preserving data processing. \nBio:\nBinbin Gu is a final-year Ph.D. candidate in Computer Science at the University of California\, Irvine\, advised by Faisal Nawab. His research lies at the intersection of trustworthy AI\, database systems\, and cryptographic verification.
URL:https://isg.ics.uci.edu/event/janki-bhimani-fiu/
LOCATION:DBH 4011
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250530T130000
DTEND;TZID=America/Los_Angeles:20250530T140000
DTSTAMP:20260419T230100
CREATED:20250401T172052Z
LAST-MODIFIED:20250521T185630Z
UID:2200-1748610000-1748613600@isg.ics.uci.edu
SUMMARY:Xiaozhen Liu
DESCRIPTION:
URL:https://isg.ics.uci.edu/event/xiaozhen-liu/
END:VEVENT
END:VCALENDAR