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:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240510T130000
DTEND;TZID=America/Los_Angeles:20240510T140000
DTSTAMP:20260528T121648
CREATED:20240422T224849Z
LAST-MODIFIED:20240422T224849Z
UID:1744-1715346000-1715349600@isg.ics.uci.edu
SUMMARY:Mike Heddes: Efficient Cardinality Estimation of Multi-Join Queries using Count Sketches
DESCRIPTION:Abstract: \nCardinality estimates are a primary input to query optimizers to determine an appropriate join order. The seminal AMS sketch can estimate the cardinality of an equi-join between two relations using little space. Since then\, two important advancements are the Count sketch\, a method which significantly improves upon the sketching time\, and secondly\, an extension of the AMS sketch to accommodate multi-join queries. However\, combining the strengths of these methods to maintain sketches for multi-join queries while ensuring fast update times is a non-trivial task\, and has remained an open problem for decades as highlighted in the existing literature. This talk will address this problem by introducing a novel sketching method which has fast updates\, even for sketches capable of accurately estimating the cardinality of complex multi-join queries. Experimental results confirm the significant improvement in update time complexity\, resulting in orders of magnitude faster estimates\, with equal or better estimation accuracy.\n\n\nBio:\nMike Heddes is a 4th-year PhD candidate at the University of California\, Irvine under supervision of Alex Nicolau and Tony Givargis. His research focusses on efficient algorithms for big data applications in machine learning and data mining. He has publications in prestigious venues such as SIGMOD\, KDD\, and JMLR. Mike has interned at Intel Labs as well as with the Advanced Concepts Team of the European Space Agency.
URL:https://isg.ics.uci.edu/event/mike-heddes-efficient-cardinality-estimation-of-multi-join-queries-using-count-sketches/
LOCATION:DBH 4011
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240531T110000
DTEND;TZID=America/Los_Angeles:20240531T120000
DTSTAMP:20260528T121648
CREATED:20240521T194943Z
LAST-MODIFIED:20240522T054705Z
UID:2030-1717153200-1717156800@isg.ics.uci.edu
SUMMARY:Mohammad Sadoghi (UC Davis): The Journey of Building Global-Scale Sustainable Blockchain Fabric 
DESCRIPTION:Abstract \nThe inception of Bitcoin and blockchain has renewed the vision of a democratic and decentralized computational paradigm\, that is\, to ingrain integrity\, transparency\, and accountability into the very fabric of the computational model. These fundamental concepts and the technologies behind them–a generic ledger-based data model\, cryptographically ensured data integrity and transparent and accountable consensus-based replication–prove to be a powerful and inspiring combination. Arguably\, the resilient consensus protocol is at the heart of this paradigm shift. To this end\, we share the story behind our (resilient) journey in building a consensus-based blockchain called Apache ResilientDB (Incubating). In this presentation\, we aim to provide an insightful overview of the core structure of the consensus protocols. We will further offer the intuitions behind our ongoing work\, including the speculative consensus model\, concurrent consensus with a wait-free property\, geo-scale meta-consensus\, consensus with weaker consistency models and isolation semantics\, as well as a variety of sharding and cross-chain protocols through our novel reliable communication primitives. \n  \nBio \nMohammad Sadoghi is an Associate Professor in the Computer Science Department at the University of California\, Davis. Formerly\, he was an Assistant Professor at Purdue University and a Research Staff Member at IBM T.J. Watson Research Center. He received his Ph.D. from the University of Toronto in 2013. He leads the ExpoLab research group with the mission to pioneer a resilient data platform at scale under our flagship project called Apache ResilientDB (Incubating)\, a distributed ledger centered around a democratic and decentralized computational model that further aims to unify secure transactional and real-time analytical processing (L-Store). He envisions ResilientDB to serve as a platform to foster “creativity.” He co-founded the blockchain spinoff\, Moka Blox LLC\, as the ResilientDB spinoff. He has over 100 publications in leading database conferences/journals and 36 filed U.S. patents. His ACM Middleware’18 entitled “QueCC: A Queue-oriented\, Control-free Concurrency Architecture” won the Best Paper Award; his paper “Dissecting BFT Consensus: In Trusted Components we Trust!” won the Best Paper Award at EuroSys’23; and his paper “The Bedrock of Byzantine Fault Tolerance: A Unified Platform for BFT Protocols Analysis\, Implementation\, and Experimentation” won the Outstanding Paper Award at NSDI’24. He has co-authored several books\, “Transaction Processing on Modern Hardware” and “Fault-tolerant Distributed Transactions on Blockchain\,” both published by Morgan & Claypool Synthesis Lectures on Data Management and a book published by Foundations and Trends® in Databases\, entitled “Consensus in Data Management: From Distributed Commit to Blockchain.“
URL:https://isg.ics.uci.edu/event/mohammad-sadoghi-uc-davis-the-journey-of-building-global-scale-sustainable-blockchain-fabric/
LOCATION:DBH 6011
END:VEVENT
END:VCALENDAR