[PDF][PDF] New graph decompositions and combinatorial boolean matrix multiplication algorithms
We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention
of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can …
of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can …
The fine-grained complexity of boolean conjunctive queries and sum-product problems
We study the fine-grained complexity of evaluating Boolean Conjunctive Queries and their
generalization to sum-of-product problems over an arbitrary semiring. For these problems …
generalization to sum-of-product problems over an arbitrary semiring. For these problems …
Faster Combinatorial k-Clique Algorithms
Detecting if a graph contains ak-Clique is one of the most fundamental problems in
computer science. The asymptotically fastest algorithm runs in time O (n ω k/3), where ω is …
computer science. The asymptotically fastest algorithm runs in time O (n ω k/3), where ω is …
The NFA acceptance hypothesis: Non-combinatorial and dynamic lower bounds
We pose the fine-grained hardness hypothesis that the textbook algorithm for the NFA
Acceptance problem is optimal up to subpolynomial factors, even for dense NFAs and fixed …
Acceptance problem is optimal up to subpolynomial factors, even for dense NFAs and fixed …
The fine-grained complexity of CFL reachability
Many problems in static program analysis can be modeled as the context-free language
(CFL) reachability problem on directed labeled graphs. The CFL reachability problem can …
(CFL) reachability problem on directed labeled graphs. The CFL reachability problem can …
Evaluating Datalog over Semirings: A Grounding-based Approach
Datalog is a powerful yet elegant language that allows expressing recursive computation.
Although Datalog evaluation has been extensively studied in the literature, so far, only loose …
Although Datalog evaluation has been extensively studied in the literature, so far, only loose …
[PDF][PDF] Worst-Case-Optimal Joins on Graphs with Topological Relations
Knowledge graphs are composed of diverse types of binary relations as distinguished by
edge labels [27]. An individual relation may have specific semantic conditions, for example …
edge labels [27]. An individual relation may have specific semantic conditions, for example …
PathFinder: Returning Paths in Graph Queries
Path queries are a central feature of all modern graph query languages and standards, such
as SPARQL, Cypher, SQL/PGQ, and GQL. While SPARQL returns endpoints of path queries …
as SPARQL, Cypher, SQL/PGQ, and GQL. While SPARQL returns endpoints of path queries …
Pathfinder: A unified approach for handling paths in graph query languages
Path queries are a core feature of modern graph query languages such as Cypher,
SQL/PGQ, and GQL. These languages provide a rich set of features for matching paths, such …
SQL/PGQ, and GQL. These languages provide a rich set of features for matching paths, such …
Size bounds and algorithms for conjunctive regular path queries
Conjunctive regular path queries (CRPQs) are one of the core classes of queries over graph
databases. They are join intensive, inheriting their structure from the relational setting, but …
databases. They are join intensive, inheriting their structure from the relational setting, but …