DBScholar

Back to papers

A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs

Summary: KG-native GED estimation: SEABED is a semantics-aware GNN that models local semantic dependencies and global consistency between two knowledge graphs, unlike prior simple-graph GED predictors. Improves MAE up to 66.7% and accuracy up to 70.5% on real KGs, with no extra runtime. (summarized by gpt-5.4-mini on Apr 12 2026)

Paper ID
h5263fb0e1866dc26
Venue
VLDB
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,708 | 28.01%
DOI
10.14778/3797919.3797930

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{zhou_vldb26,
        title = {{A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs}},
        author = {Zhou, Yingli and Wang, Huizhong and Ma, Chenhao and Fang, Yixiang},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {6},
        pages = {1226--1239},
        doi = {10.14778/3797919.3797930},
        url = {https://doi.org/10.14778/3797919.3797930},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 23 of 23 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021246
402 Worst-case Optimal Join Algorithms 2012 PODS 0.00019104625
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018197688
466 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017773029
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,045 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012322402
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,249 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011340141
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010197978
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,014 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1832045e-05
2,020 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1729558e-05
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0476814e-05
2,166 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9334874e-05
3,453 Computing Graph Edit Distance via Neural Graph Matching 2023 VLDB 7.2904632e-05
3,880 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9510799e-05
3,994 TaGSim: Type-aware Graph Similarity Learning and Computation 2022 VLDB 6.8678851e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
6,469 Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks 2024 SIGMOD 5.7743636e-05
8,178 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.382671e-05
8,231 Computing Approximate Graph Edit Distance via Optimal Transport 2025 SIGMOD 5.3722895e-05
Previous Page 1 / 1 Next

Semantically Similar Papers