Cover Image

PANDA: Query Evaluation in Submodular Width

Fuente: arXiv

Saved in:

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

Similar Items

PANDAExpress: a Simpler and Faster PANDA Algorithm
by: Khamis, Mahmoud Abo, et al.
Published: (2025)

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)

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

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

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

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

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)

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

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

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

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

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

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

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

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

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

The Space-Time Complexity of Sum-Product Queries
by: Deeds, Kyle, et al.
Published: (2025)

Cuts and Gauges for Submodular Width
by: Lanzinger, Matthias
Published: (2026)

Galley: Modern Query Optimization for Sparse Tensor Programs
by: Deeds, Kyle, et al.
Published: (2024)

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

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

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

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

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

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

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

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)

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

Thucy: An LLM-based Multi-Agent System for Claim Verification across Relational Databases
by: Theologitis, Michael, et al.
Published: (2025)

From HNSW to Information-Theoretic Binarization: Rethinking the Architecture of Scalable Vector Search
by: Abtahi, Seyed Moein, et al.
Published: (2025)

Data-Aware Socratic Query Refinement in Database Systems
by: Zhang, Ruiyuan, et al.
Published: (2025)

Constraint based Modeling according to Reference Design
by: Heiland, Erik, et al.
Published: (2024)

Efficient Filtered-ANN via Learning-based Query Planning
by: Gan, Zhuocheng, et al.
Published: (2026)

POQD: Performance-Oriented Query Decomposer for Multi-vector retrieval
by: Liu, Yaoyang, et al.
Published: (2025)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
by: Im, Sungjin, et al.
Published: (2023)

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