Back to papers
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics
Summary: Proposes S3AND, a subgraph-similarity formulation that fuses keyword matching with a novel aggregated neighbor-difference structural metric to find query-like subgraphs. Introduces keyword-set and aggregated-neighbor-difference lower-bound pruning plus an index for efficient, scalable search.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13994
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,696 | 25.59%
- DOI
-
10.14778/3749646.3749648
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 951 |
Comparing Stars: On Approximating Graph Edit Distance |
2009 |
VLDB |
0.00015106325 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 2,551 |
NeMa: Fast Graph Search with Label Similarity |
2013 |
VLDB |
8.5572574e-05 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 3,320 |
Schemaless and Structureless Graph Querying |
2014 |
VLDB |
7.2249102e-05 |
| 3,862 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
6.687769e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 6,441 |
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding |
2024 |
VLDB |
5.0603113e-05 |
| 9,058 |
Semantic SPARQL Similarity Search Over RDF Knowledge Graphs |
2016 |
VLDB |
4.4039656e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,743 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9586508e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 2,117 |
Efficient SimRank-based Similarity Join Over Large Graphs |
2013 |
VLDB |
9.5155578e-05 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 2,525 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
8.5981082e-05 |
| 4,958 |
Efficient Subgraph Search over Large Uncertain Graphs |
2011 |
VLDB |
5.8031038e-05 |
| 3,862 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
6.687769e-05 |
| 9,058 |
Semantic SPARQL Similarity Search Over RDF Knowledge Graphs |
2016 |
VLDB |
4.4039656e-05 |
| 6,441 |
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding |
2024 |
VLDB |
5.0603113e-05 |
| 3,873 |
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases |
2012 |
VLDB |
6.6779082e-05 |