Database Paper Browser

Back to papers

Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs

Summary: DP-B and DP-P: two algorithms for exact top-ranked twig-pattern matching on large graphs. DP-B runs in time and space linear in data size even with exponential matches; DP-P is often sublinear in practice, making these the first guarantees of this kind, with experimental validation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4017
Venue
SIGMOD
Year
2008
Pagerank
6.4129418e-05
Overall Rank
4,143 | 71.18%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
919 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00015343179
3,320 Schemaless and Structureless Graph Querying 2014 VLDB 7.2249102e-05
4,807 Diversified Top-k Graph Pattern Matching 2013 VLDB 5.9092289e-05
7,762 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 4.6583829e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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