Extending Graph Rules with Oracles

Summary: GROs: graph rules that call oracles (external KBs, aggregates, ML predicates) and use pivoted dual‑simulation semantics. Chase-based, Church‑Rosser; deduction and incremental inference in PTIME with sequential/parallel algorithms and scalable experiments—contrasts prior intractability. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: h43ceae783aa961f7
Venue: VLDB
Year: 2024
Pagerank: 4.9605343e-05
Overall Rank: 11,618 | 22.13%
DOI: 10.14778/3654621.3654641
PDF: Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

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

Authors

1. Xueli Liu (Tianjin University)
2. Bowen Dong (Tianjin University)
3. Wenzhi Fu (University of Edinburgh)
4. Nannan Wu (Tianjin University)
5. Xin Wang (Tianjin University)
6. Wenjun Wang (Tianjin University)

BibTeX Citation

@article{liu_vldb24,
        title = {{Extending Graph Rules with Oracles}},
        author = {Liu, Xueli and Dong, Bowen and Fu, Wenzhi and Wu, Nannan and Wang, Xin and Wang, Wenjun},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {7},
        pages = {1775--1787},
        doi = {10.14778/3654621.3654641},
        url = {https://doi.org/10.14778/3654621.3654641},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
902	Parallelizing Sequential Graph Computations	2017	SIGMOD	0.00013142001
952	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.00012878316
1,148	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00011777466
1,323	Incremental Graph Pattern Matching	2011	SIGMOD	0.00011019578
2,269	Dependencies for Graphs	2017	PODS	8.711418e-05
2,894	Functional Dependencies for Graphs	2016	SIGMOD	7.8870146e-05
4,240	The Interaction between Functional Dependencies and Template Dependencies	1980	SIGMOD	6.7009223e-05
4,557	Incrementalizing Graph Algorithms	2021	SIGMOD	6.5264915e-05
4,838	Association Rules with Graph Patterns	2015	VLDB	6.3753978e-05
5,968	Distributed Graph Simulation: Impossibility and Possibility	2014	VLDB	5.9135528e-05
7,263	Discovering Graph Functional Dependencies	2018	SIGMOD	5.5557683e-05
7,502	Extending Graph Patterns with Conditions	2020	SIGMOD	5.4943054e-05
8,313	Capturing Associations in Graphs	2020	VLDB	5.3410298e-05
8,420	Deducing Certain Fixes to Graphs	2019	VLDB	5.3198062e-05
9,006	Adding Counting Quantifiers to Graph Patterns	2016	SIGMOD	5.2253856e-05
12,259	Catching Numeric Inconsistencies in Graphs	2018	SIGMOD	4.9605343e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,357	Simple, Fast, and Scalable Reachability Oracle	2013	VLDB
2	12,203	Answering Why-questions by Exemplars in Attributed Graphs	2019	SIGMOD
3	288	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD
4	2,930	Extracting and Analyzing Hidden Graphs from Relational Databases	2017	SIGMOD
5	7,601	Robust Entity Resolution using Random Graphs	2018	SIGMOD
6	2,269	Dependencies for Graphs	2017	PODS
7	11,605	Capturing More Associations by Referencing External Graphs	2024	VLDB
8	7,318	Discovering Association Rules from Big Graphs	2022	VLDB
9	9,847	Making It Tractable to Catch Duplicates and Conflicts in Graphs	2023	SIGMOD
10	8,313	Capturing Associations in Graphs	2020	VLDB