Database Paper Browser

Back to papers

Context-Free Path Querying via Matrix Equations

Summary: CFPQ evaluation via reduction to systems of matrix equations over R, enabling use of high-performance linear-algebra solvers. Real-world data applicability, leveraging a matrix-analytic framework for scalable CFG-inspired path queries on large graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5832
Venue
SIGMOD
Year
2020
Pagerank
4.1945683e-05
Overall Rank
11,564 | 19.56%
DOI
10.1145/3318464.3384400

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,474 Graph-Theoretic Methods In Database Theory 1990 PODS 8.7135761e-05
Previous Page 1 / 1 Next

Semantically Similar Papers