What is it about?
This work focuses on optimizing queries over graph databases. We first provide an algorithm working over all queries: this algorithm is quite costly, but proves that no efficient algorithm can handle all queries. We then provide an efficient algorithm for a large fragment of queries that contain most of the queries used in practice.
Featured Image
Read the Original
This page is a summary of: Minimizing Conjunctive Regular Path Queries, Proceedings of the ACM on Management of Data, June 2025, ACM (Association for Computing Machinery),
DOI: 10.1145/3725237.
You can read the full text:
Resources
Contributors
The following have contributed to this page
