Factorized Databases

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=-XmJ7a1WbWg


Duration: 51:25
282 views
14

Ahmet Kara (University of Zurich)
https://simons.berkeley.edu/talks/ahmet-kara-university-zurich-2023-10-18
Probabilistic Circuits and Logic

Factorized databases are compressed yet lossless representations of relational data that allow for efficient processing in the compressed domain. They are relational algebra expressions built using the union operator, the Cartesian product operator and data values. By exploiting the distributivity of product over union, they avoid the redundancy in the tabular representation of relational data. Factorized representations of join result can be computed directly from the input database and in time proportional to their sizes and the input database size. Since their introduction a decade ago, there has been great progress on the theory, systems and applications of factorized databases. We explain the foundations of factorized databases and overview some of their applications in the fields of static and dynamic relational algorithms, probabilistic databases, and in-database machine learning.



Other Videos By Simons Institute for the Theory of Computing


2023-10-20Tractable Control for Autoregressive Language Generation
2023-10-20On Finding Modes of Gaussian Sum-Product Networks
2023-10-20Marginal Determinism in Structured Decomposable Circuits
2023-10-19Weighted Model Integration
2023-10-19An Approximate Skolem Function Counter
2023-10-19Subtractive Mixture Models: Representation and Learning
2023-10-19The Rise of Tractable Circuits: From Cryptography to Continuous Generative Models
2023-10-19Decision Diagrams for Efficient Inference and Optimization in Expressive Discrete+Continuous Domains
2023-10-18Solving Marginal MAP Exactly by Probabilistic Circuit Transformations
2023-10-18Direct Access for Conjunctive Queries with Negation
2023-10-18Factorized Databases
2023-10-18Leveraging tree automata approximation results for efficient sampling and counting...
2023-10-18Efficient Enumeration Algorithms via Circuits
2023-10-17Lower Bounds for Tractable Arithmetic Circuits
2023-10-17Tractable Bounding of Counterfactual Queries by Knowledge Compilation
2023-10-17Combined Approximations for Probabilistic Query Evaluation: An Intensional Approach
2023-10-17First-Order Model Counting and Sampling
2023-10-17AND/OR Search Spaces for Anytime Probabilistic Reasoning
2023-10-17Credal Models for Uncertainty and Logic Treatment
2023-10-16Model Counting Meets Distinct Estimation
2023-10-16The Intensional-Extensional Problem in Probabilistic Databases


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Probabilistic Circuits and Logic
Ahmet Kara