DBScholar

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
4079
Venue
SIGMOD
Year
2008
Pagerank
6.8233111e-05
Overall Rank
4,221 | 71.05%
DOI
10.1145/1376616.1376676

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gou_sigmod08,
        title = {{Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs}},
        author = {Gou, Gang and Chirkova, Rada},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376676},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376676},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
776 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00014110016
3,908 Diversified Top-k Graph Pattern Matching 2013 VLDB 7.0262215e-05
4,372 Schemaless and Structureless Graph Querying 2014 VLDB 6.7384384e-05
7,664 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 5.5720259e-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