1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DB2026
Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
Mahmoud Abo-Khamis, Eden Chmielewski, Andrei Draghici +2
We study the classical incremental view maintenance problem: Given a query and a database, maintain the query output under single-tuple updates (inserts or deletes) to the database…
cs.DB2024★ 1 cited
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…