Back to papers
NeMa: Fast Graph Search with Label Similarity
Summary: NeMa: neighborhood-based subgraph search for labeled, heterogeneous networks. It defines a unified node-level cost combining structure and label similarity to yield top-k matches; NP-hard, solved with a heuristic inference-model and optimizations, outperforming keyword search and baselines.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 10667
- Venue
- VLDB
- Year
- 2013
- Pagerank
- 8.5572574e-05
- Overall Rank
- 2,551 | 82.26%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 444 |
Parallelizing Sequential Graph Computations |
2017 |
SIGMOD |
0.00022987918 |
| 1,958 |
Exemplar Queries: Give me an Example of What You Need |
2014 |
VLDB |
9.9572632e-05 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-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 |
| 5,031 |
Event Pattern Matching over Graph Streams |
2015 |
VLDB |
5.7499783e-05 |
| 5,854 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.3006473e-05 |
| 7,775 |
Graph Querying Meets HCI: State of the Art and Future Directions |
2017 |
SIGMOD |
4.653773e-05 |
| 8,210 |
Mining Top-k Pairs of Correlated Subgraphs in a Large Network |
2020 |
VLDB |
4.5581054e-05 |
| 9,058 |
Semantic SPARQL Similarity Search Over RDF Knowledge Graphs |
2016 |
VLDB |
4.4039656e-05 |
| 9,575 |
GARUDA: A System for Large-Scale Mining of Statistically Significant Connected Subgraphs |
2016 |
VLDB |
4.325244e-05 |
| 9,580 |
ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs |
2020 |
VLDB |
4.3234342e-05 |
| 9,887 |
Graph Exploration: From Users to Large Graphs |
2017 |
SIGMOD |
4.2621158e-05 |
| 10,696 |
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics |
2025 |
VLDB |
4.1945683e-05 |
| 11,565 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
4.1945683e-05 |
| 11,818 |
NED: An Inter-Graph Node Metric Based On Edit Distance |
2017 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 4 |
Pregel: A System for Large-Scale Graph Processing |
2010 |
SIGMOD |
0.0019005923 |
| 301 |
BLINKS: Ranked Keyword Searches on Graphs |
2007 |
SIGMOD |
0.00028370644 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 1,285 |
Neighborhood Based Fast Graph Search in Large Networks |
2011 |
SIGMOD |
0.00012833377 |
| 1,414 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012118275 |
| 1,454 |
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs |
2010 |
VLDB |
0.00011913289 |
| 2,196 |
gStore: Answering SPARQL Queries via Subgraph Matching |
2011 |
VLDB |
9.3089621e-05 |
| 2,399 |
Query Rewriting for Semistructured Data |
1999 |
SIGMOD |
8.8973689e-05 |
| 2,770 |
Keyword Search in Graphs: Finding r-cliques |
2011 |
VLDB |
8.1437191e-05 |
| 2,938 |
Graph Homomorphism Revisited for Graph Matching |
2010 |
VLDB |
7.8524059e-05 |
| 3,315 |
Supporting Ontology-based Semantic Matching in RDBMS |
2004 |
VLDB |
7.2302145e-05 |
| 4,946 |
Querying Graph Patterns |
2011 |
PODS |
5.8149362e-05 |
| 5,776 |
Capturing Topology in Graph Pattern Matching |
2012 |
VLDB |
5.3309758e-05 |
| 6,676 |
A Gauss Function Based Approach for Unbalanced Ontology Matching |
2009 |
SIGMOD |
4.9659764e-05 |
Semantically Similar Papers