23.
apr
Vabljeno predavanje: prof. Abbadi – Taming Big Data
ob 14:15
V okviru Fulbrightove štipendije bo od 20. 4. do 2. 5. 2026 na UL FRI gostoval prof. Amr El Abbadi (ACM Fellow, IEEE Fellow, AAAS Fellow) z Univerze v Kaliforniji (UC Santa Barbara), ZDA. V času gostovanja bo izvedel več predavanj.
Vabljeni predvsem na predavanje v četrtek, 23. 4., ob 14.15 v Diplomski sobi, kjer bo predstavil raziskovalne dosežke svoje skupine:
Naslov predavanja: “Taming Big Data: Stream Summarization and its Many Applications"
Povzetek:
During the past two decades we have seen an unprecedented increase in the amount of data that is generated from numerous internet-scale applications. As hundreds of millions to billions of users interact with these applications, there is a continuous flow of interactions that are collected by internet companies hosting these applications. Before this data can be subject to modeling and analysis, it is often necessary to obtain summary statistics such as the cardinality of unique visitors, frequency counts of users from different states or countries, and in general, finding the quantile information from the dataset. Efficient algorithms exist for computing the exact information over the data. Unfortunately, these algorithms require a considerable amount of time, scanning the data multiple times, or require additional storage that is linear in the size of the dataset itself. Approximation methods, with guaranteed error bounds, developed in the context of streaming data are extremely effective to extract useful and relatively accurate knowledge from big data. In this talk, we will review the recent, and not so recent, advances in big data stream summarization. The main objective of this talk is to demonstrate the strong relationship between the mathematics of big data and the management of big data. We will discuss streaming data summarization focusing on the heavy hitter’s problem in diverse setting, including recent advance for environments with both insertions and deletions; privacy challenges and applications for caching in large scale elastic cloud environments and data analysis and monitoring in modern software defined networks.
Vabljeni tudi na ostala predavanja, ki jih bo prof. El Abbadi imel na FRI:
- V ponedeljek, 20. 4. 2026, 9.30-10.45, predavalnica P02 (na predavanju Komunikacijski protokoli): “Private Communication Using Untrusted Service Providers”
- V torek, 21. 4. 2026, 14.15-17.00, predavalnica P22 (na predavanju Visoko zmogljivo računanje): “Distributed Systems and Databases of the Globe Unite!”
- V sredo, 22. 4. 2026, 14.15-15.00, predavalnica P18 (predstavitev tekočih raziskav): “Private LLM Inference with Homomorphic Encryption”
O predavatelju:
Amr El Abbadi is a Professor of Computer Science. He received his B. Eng. from Alexandria University, Egypt, and his Ph.D. from Cornell University. His research interests are in the fields of fault-tolerant distributed systems and databases, focusing recently on Cloud data management, blockchain based systems and privacy concerns. Prof. El Abbadi is an ACM Fellow, AAAS Fellow, and IEEE Fellow. He was Chair of the Computer Science Department at UCSB from 2007 to 2011. He served as Associate Graduate Dean at the University of California, Santa Barbara from 2021--2023. He served as a journal editor for several database journals, including The VLDB Journal, IEEE Transactions on Computers and The Computer Journal. He has been Program Chair for multiple database and distributed systems conferences, including most recently SIGMOD 2022. He served on the executive committee of the IEEE Technical Committee on Data Engineering (TCDE) and was a board member of the VLDB Endowment from 2002 to 2008. In 2007, Prof. El Abbadi received the UCSB Senate Outstanding Mentorship Award for his excellence in mentoring graduate students. In 2013, his student, Sudipto Das received the SIGMOD Jim Gray Doctoral Dissertation Award. Prof. El Abbadi is also a co-recipient of the Test of Time Award at EDBT/ICDT 2015. In 2020, Prof El Abbadi was elected Outstanding CS faculty by the graduating seniors at UCSB. Recently, papers he co-authored received an Outstanding paper award in NSDI (Networked System Design and Implementation) 2024 and the Test of Time Award from MDM (Mobile Data Management)2024. He has published over 350 articles in databases and distributed systems and has supervised over 40 PhD students.
Povzetki predavanj:
Monday 20. 4, 9:30 - 10:45, room P2 (within Communications Protocol class) - Private Communication Using Untrusted Service Providers
Our digital lives have become increasingly interdependent and interconnected. Such interconnections rely on a vast network of actors whose trustworthiness is not always guaranteed. Over the past three decades, rapid advances in computing and communication technologies have enabled billions of users with access to information and connectivity at their fingertips. Unfortunately, this rapid digitization of our personal lives is also now vulnerable to invasions of privacy. In particular, we need to worry about the malicious intent of individual actors in the network as well as large and powerful organizations such as service providers and nation states. Given such an untrusted world, we illustrate some of the privacy challenges by focusing on the following research questions: can we design a scalable infrastructure for voice communication that will hide meta-information regarding who is communicating with whom? The solution to this challenge has significant ramification on diverse data management problems
such as designing scalable systems for oblivious search for documents from public repositories as well as private query processing over public databases. These are some of the iconic problems that must be solved before we can embark on building trusted platforms and services over untrusted infrastructures.
Tuesday 21. 4. 14:15 - 17:00, room P22 (within High Performance Computing class) - Distributed Systems and Databases of the Globe Unite!
Significant paradigm shifts are occurring in Access patterns are widely dispersed and large scale analysis requires real-time responses. Many of the fundamental challenges have been studied and explored by both the distributed systems and the database communities for decades. However, the current changing and scalable setting often requires a rethinking of basic assumptions and premises. The rise of the cloud computing paradigm with its global reach has resulted in novel approaches to integrate traditional concepts in novel guises to solve fault-tolerance and scalability challenges. This is especially the case when users require real-time global access. Exploiting edge cloud resources becomes critical for improved performance, which requires a reevaluation of many paradigms, even for a traditional problem like caching. The need for transparency and accessibility has led to innovative ways for managing large scale replicated logs and ledgers, giving rise to blockchains and their many applications. In this talk we will be explore some of these new trends while emphasizing the novel challenges they raise from both distributed systems as well as database points of view. We will propose a unifying framework for traditional consensus and commitment protocols and discuss protocols that manage computing resources to enhance performance. Our overall goal is to explore approaches that unite and exploit many of the significant efforts made in distributed systems and databases to address the novel and pressing needs of today's global computing infrastructure.
Wednesday 22. 4. 14:15 - 15:00, room P18 - Private LLM Inference with Homomorphic Encryption
As large language models (LLMs) are increasingly deployed across a wide range of applications, protecting the privacy of user queries has become a critical concern. Fully homomorphic encryption (FHE) offers a compelling approach to this problem by enabling computation directly over encrypted data, allowing an untrusted server to execute LLM inference without learning the underlying inputs. Despite its promise, private LLM inference under FHE presents substantial technical challenges. This tutorial-style talk will cover the basics of homomorphic encryption, followed by an exploration of the internal structure of transformer models and how those components, including matrix multiplications and nonlinear layers, can be implemented efficiently under homomorphic encryption.
