Database Paper Browser

Back to papers

Correlation Constraint Shortest Path over Large Multi-Relation Graphs

Summary: Shortest path under vertex-correlation constraints on multi-relational graphs with recursive necessity and denial; extends beyond edge-label reachability. HyRE encodes topology and relation types compactly to prune search; evaluated on real-world graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11981
Venue
VLDB
Year
2019
Pagerank
4.6230399e-05
Overall Rank
7,897 | 45.07%
DOI
10.14778/3303753.3303756

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers