Cover Image

PANDAExpress: a Simpler and Faster PANDA Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Khamis, Mahmoud Abo, Ngo, Hung Q., Suciu, Dan
Format:	Preprint
Published:	2025
Subjects:	Databases Information Theory Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

PANDA: Query Evaluation in Submodular Width
by: Khamis, Mahmoud Abo, et al.
Published: (2024)

Query Optimization and Evaluation via Information Theory: A Tutorial
by: Khamis, Mahmoud Abo, et al.
Published: (2026)

Fast Matrix Multiplication meets the Submodular Width
by: Abo-Khamis, Mahmoud, et al.
Published: (2024)

Join Size Bounds using Lp-Norms on Degree Sequences
by: Khamis, Mahmoud Abo, et al.
Published: (2023)

Pessimistic Cardinality Estimation
by: Khamis, Mahmoud Abo, et al.
Published: (2024)

Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation
by: Khamis, Mahmoud Abo, et al.
Published: (2025)

Convergence of Datalog over (Pre-) Semirings
by: Khamis, Mahmoud Abo, et al.
Published: (2021)

Applications of Information Inequalities to Database Theory Problems
by: Suciu, Dan
Published: (2023)

Output-Sensitive Evaluation of Regular Path Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2024)

Insert-Only versus Insert-Delete in Dynamic Query Evaluation
by: Khamis, Mahmoud Abo, et al.
Published: (2023)

LpBound: Pessimistic Cardinality Estimation using $\ell_p$-Norms of Degree Sequences
by: Zhang, Haozhe, et al.
Published: (2025)

Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025)

Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
by: Khamis, Mahmoud Abo, et al.
Published: (2026)

Output-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025)

A Unifying Algorithm for Hierarchical Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
by: Gawrychowski, Pawel, et al.
Published: (2024)

Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
by: Abo-Khamis, Mahmoud, et al.
Published: (2026)

Listing Even Cycles Faster than the Submodular-Width Barrier
by: Nakos, Vasileios, et al.
Published: (2026)

Novel Decoding Algorithm for Noiseless Non-Adaptive Group Testing
by: Franco-Vivo, Manuel
Published: (2026)

Smoothed analysis in compressed sensing
by: Aigner-Horev, Elad, et al.
Published: (2025)

An Algorithm for Streaming Differentially Private Data
by: Kumar, Girish, et al.
Published: (2024)

Foundations for Digital Twins
by: Wilson, Finn, et al.
Published: (2024)

Unifying AMP Algorithms for Rotationally-Invariant Models
by: Liu, Songbin, et al.
Published: (2024)

On Universality of Non-Separable Approximate Message Passing Algorithms
by: Lovig, Max, et al.
Published: (2025)

HoneyComb: A Parallel Worst-Case Optimal Join on Multicores
by: Wu, Jiacheng, et al.
Published: (2025)

Ambidextrous Degree Sequence Bounds for Pessimistic Cardinality Estimation
by: Lin, Yu-Ting, et al.
Published: (2025)

Compressing integer lists with Contextual Arithmetic Trits
by: Barsamian, Yann, et al.
Published: (2022)

Wrangling Data Issues to be Wrangled: Literature Review, Taxonomy, and Industry Case Study
by: Qin, Qiaolin, et al.
Published: (2024)

A Partial-Exclusion Repair Scheme for MDS Codes
by: Zhao, Wei, et al.
Published: (2026)

The MAGIC of Data Management: Understanding the Value and Activities of Data Management
by: Lukyanenko, Roman
Published: (2024)

The Case for Cardinality Lower Bounds
by: Stoian, Mihail, et al.
Published: (2026)

A Plaque Test for Redundancies in Relational Data [Extendend Version]
by: Köhnen, Christoph, et al.
Published: (2023)

Minimum entropy of a log-concave variable for fixed variance
by: Melbourne, James, et al.
Published: (2023)

Optimality of Approximate Message Passing Algorithms for Spiked Matrix Models with Rotationally Invariant Noise
by: Dudeja, Rishabh, et al.
Published: (2024)

On the Optimality of Gaussian Code-books for Signaling over a Two-Users Weak Gaussian Interference Channel
by: Khandani, Amir K.
Published: (2025)

Queue occupancy and server size distribution of a queue length dependent vacation queue with an optional service
by: Verma, Ashish, et al.
Published: (2026)

Algorithmic Randomness in Continuous-Time Markov Chains
by: Huang, Xiang, et al.
Published: (2019)

OpenZL: Using Graphs to Compress Smaller and Faster
by: Collet, Yann, et al.
Published: (2026)

Universal Graph Compression: Stochastic Block Models
by: Bhatt, Alankrita, et al.
Published: (2020)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)