Database Paper Browser

Back to papers

Mining and Indexing Graphs for Supergraph Search

Summary: Supergraph search (SPS) on graph databases; subgraph/supergraph checks are NP-hard, motivating index-based SPS. Proposes subgraph mining optimizing both filtering and prefix-sharing gains, LW-index, and two approximations (1-1/e, 1/4); yields 3-10× SPS speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10744
Venue
VLDB
Year
2013
Pagerank
5.0765917e-05
Overall Rank
6,406 | 55.44%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,072 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 6.4727847e-05
11,598 IDAR: Fast Supergraph Search Using DAG Integration 2020 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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