Catching Numeric Inconsistencies in Graphs
Summary: Proposes NGDs: graph dependencies extended with linear arithmetic to catch numeric inconsistencies. Complexity: SAT Sigma2^P; IMP Pi2^P; VLD coNP; nonlinear deg-2 undecidable; IncDect incremental, localizable, parallelizable; includes scalable evaluation on graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Wenfei Fan (Beihang University; University of Edinburgh)
- 2. Xueli Liu (Harbin Engineering University)
- 3. Ping Lu (Beihang University)
- 4. Chao Tian (Beihang University; University of Edinburgh)
BibTeX Citation
@inproceedings{fan_sigmod18,
title = {{Catching Numeric Inconsistencies in Graphs}},
author = {Fan, Wenfei and Liu, Xueli and Lu, Ping and Tian, Chao},
series = {{SIGMOD} '18},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3183713.3183753},
url = {https://dl.acm.org/doi/10.1145/3183713.3183753},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,443 | Incrementalizing Graph Algorithms | 2021 | SIGMOD | 6.7004839e-05 |
| 6,403 | Parallel Discrepancy Detection and Incremental Detection | 2021 | VLDB | 5.8859374e-05 |
| 7,099 | Discovering Graph Functional Dependencies | 2018 | SIGMOD | 5.7043774e-05 |
| 7,330 | Discovering Association Rules from Big Graphs | 2022 | VLDB | 5.6435171e-05 |
| 7,365 | Extending Graph Patterns with Conditions | 2020 | SIGMOD | 5.6329929e-05 |
| 8,113 | Capturing Associations in Graphs | 2020 | VLDB | 5.484341e-05 |
| 9,627 | Making It Tractable to Catch Duplicates and Conflicts in Graphs | 2023 | SIGMOD | 5.2434488e-05 |
| 10,763 | Rule-Based Graph Cleaning with GPUs on a Single Machine | 2025 | SIGMOD | 5.093636e-05 |
| 11,227 | Extending Graph Rules with Oracles | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 500 | Scalable SPARQL Querying of Large RDF Graphs | 2011 | VLDB | 0.00017413839 |
| 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.0001179597 |
| 1,552 | Scalable Subgraph Enumeration in MapReduce | 2015 | VLDB | 0.00010379532 |
| 1,842 | Sequential Dependencies | 2009 | VLDB | 9.6345922e-05 |
| 2,041 | Combining Quantitative and Logical Data Cleaning | 2016 | VLDB | 9.2692538e-05 |
| 2,324 | Dependencies for Graphs | 2017 | PODS | 8.7506505e-05 |
| 2,798 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 8.1129891e-05 |
| 2,973 | Functional Dependencies for Graphs | 2016 | SIGMOD | 7.9083516e-05 |
| 3,251 | Keys for Graphs | 2015 | VLDB | 7.5963955e-05 |
| 5,361 | Answering Queries Using Views with Arithmetic Comparisons | 2002 | PODS | 6.2484907e-05 |
| 5,519 | Repairing Vertex Labels under Neighborhood Constraints | 2014 | VLDB | 6.1885644e-05 |
| 7,099 | Discovering Graph Functional Dependencies | 2018 | SIGMOD | 5.7043774e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,627 | Making It Tractable to Catch Duplicates and Conflicts in Graphs | 2023 | SIGMOD |
| 2 | 8,113 | Capturing Associations in Graphs | 2020 | VLDB |
| 3 | 8,225 | Deducing Certain Fixes to Graphs | 2019 | VLDB |
| 4 | 7,099 | Discovering Graph Functional Dependencies | 2018 | SIGMOD |
| 5 | 2,047 | Functional and Inclusion Dependencies: A Graph Theoretic Approach | 1984 | PODS |
| 6 | 6,403 | Parallel Discrepancy Detection and Incremental Detection | 2021 | VLDB |
| 7 | 4,443 | Incrementalizing Graph Algorithms | 2021 | SIGMOD |
| 8 | 7,365 | Extending Graph Patterns with Conditions | 2020 | SIGMOD |
| 9 | 2,798 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD |
| 10 | 2,973 | Functional Dependencies for Graphs | 2016 | SIGMOD |