activity
20242026
most citedOutput-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries

1 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing cs.DBShow all

8 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.DB2025

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…

cs.DB2025★ 1 cited

Output-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries

Mahmoud Abo Khamis, Alexandru-Mihai Hurjui, Ahmet Kara +3

Conjunctive Regular Path Queries, or CRPQs for short, are an essential construct in graph query languages. In this paper, we propose the first output-sensitive algorithm for evalua…

cs.DB2025

Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation

Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu +1

Estimating the cardinality of the output of a query is a fundamental problem in database query processing. In this article, we overview a recently published contribution that casts…

cs.DB2025★ 1 cited

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…

cs.DB2024★ 1 cited

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…

cs.DB2024

Pessimistic Cardinality Estimation

Mahmoud Abo Khamis, Kyle Deeds, Dan Olteanu +1

Cardinality Estimation is to estimate the size of the output of a query without computing it, by using only statistics on the input relations. Existing estimators try to return an…

cs.DB2024

QirK: Question Answering via Intermediate Representation on Knowledge Graphs

Jan Luca Scheerer, Anton Lykov, Moe Kayali +4

We demonstrate QirK, a system for answering natural language questions on Knowledge Graphs (KG). QirK can answer structurally complex questions that are still beyond the reach of e…