1 citations · 1 across the 1 of their papers we have counts for
5 papers
Fast Matrix Multiplication meets the Submodular Width
Mahmoud Abo Khamis, Xiao Hu, Dan Suciu
One fundamental question in database theory is the following: Given a Boolean Conjunctive Query (BCQ) Q, what is the best complexity for computing the answer to Q in terms of the i…
Query Optimization and Evaluation via Information Theory: A Tutorial
Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu
Database theory is exciting because it studies highly general and practically useful abstractions. Conjunctive query (CQ) evaluation is a prime example: it simultaneously generaliz…
A Unifying Algorithm for Hierarchical Queries
Mahmoud Abo Khamis, Jesse Comer, Phokion Kolaitis +2
The class of hierarchical queries is known to define the boundary of the dichotomy between tractability and intractability for the following two extensively studied problems about…
Output-Sensitive Evaluation of Regular Path Queries
Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu +1
We study the classical evaluation problem for regular path queries: Given an edge-labeled graph and a regular path query, compute the set of pairs of vertices that are connected by…
LpBound: Pessimistic Cardinality Estimation using -Norms of Degree Sequences
Haozhe Zhang, Christoph Mayer, Mahmoud Abo Khamis +2
Cardinality estimation is the problem of estimating the size of the output of a query, without actually evaluating the query. The cardinality estimator is a critical piece of a que…