1 citations · 3 across the 8 of their papers we have counts for
3 papers · 1 filter
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…
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…
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…