Showing 2026Show all
2 papers · 1 filter
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.DB2026
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
Mahmoud Abo Khamis, Alexandru-Mihai Hurjui, Ahmet Kara +2
We present an output-sensitive algorithm for evaluating an acyclic Conjunctive Regular Path Query (CRPQ). Its complexity is written in terms of the input size, the output size, and…