Back to papers
Keys for Graphs
Summary: Proposes keys defined recursively by patterns and subgraph isomorphism; extends relational/XML keys for identification. Matching G with Σ is intractable and not log-round parallel; two scalable MapReduce and vertex-centric algorithms are proposed.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 11036
- Venue
- VLDB
- Year
- 2015
- Pagerank
- 6.8345712e-05
- Overall Rank
- 3,694 | 74.31%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 2,450 |
Functional Dependencies for Graphs |
2016 |
SIGMOD |
8.7882979e-05 |
| 2,527 |
Dependencies for Graphs |
2017 |
PODS |
8.5954406e-05 |
| 3,306 |
PG-Keys: Keys for Property Graphs |
2021 |
SIGMOD |
7.2437997e-05 |
| 4,494 |
Multi-Query Optimization for Subgraph Isomorphism Search |
2017 |
VLDB |
6.1414196e-05 |
| 5,941 |
Big Graphs: Challenges and Opportunities |
2022 |
VLDB |
5.2635446e-05 |
| 6,690 |
Parallel Discrepancy Detection and Incremental Detection |
2021 |
VLDB |
4.9621556e-05 |
| 7,185 |
Certus: An Effective Entity Resolution Approach with Graph Differential Dependencies (GDDs) |
2019 |
VLDB |
4.8066159e-05 |
| 7,287 |
Discovering Association Rules from Big Graphs |
2022 |
VLDB |
4.7762276e-05 |
| 8,211 |
Capturing Associations in Graphs |
2020 |
VLDB |
4.5581054e-05 |
| 8,409 |
Ontology-based Entity Matching in Attributed Graphs |
2019 |
VLDB |
4.5205877e-05 |
| 8,422 |
Deducing Certain Fixes to Graphs |
2019 |
VLDB |
4.5167705e-05 |
| 9,487 |
Making It Tractable to Catch Duplicates and Conflicts in Graphs |
2023 |
SIGMOD |
4.3341665e-05 |
| 9,564 |
Catching Numeric Inconsistencies in Graphs |
2018 |
SIGMOD |
4.3254416e-05 |
| 10,250 |
Structural Normalization of Property Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,486 |
Rule-Based Graph Cleaning with GPUs on a Single Machine |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,461 |
GRIP: Constraint-based Explanation of Missing Answers for Graph Queries |
2021 |
SIGMOD |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,940 |
Privacy Preserving Subgraph Matching on Large Graphs in Cloud |
2016 |
SIGMOD |
5.8180285e-05 |
| 5,031 |
Event Pattern Matching over Graph Streams |
2015 |
VLDB |
5.7499783e-05 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,635 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.0001105793 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 11,559 |
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees |
2020 |
SIGMOD |
4.1945683e-05 |
| 1,414 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012118275 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 8,409 |
Ontology-based Entity Matching in Attributed Graphs |
2019 |
VLDB |
4.5205877e-05 |