KGFMs can predict links using observed half-links, with performance varying across four scenarios of half-link visibility in inference graphs.
In Proceedings of the 2022 International Conference on Management of Data (Philadelphia, PA, USA) (SIGMOD ’22)
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Introduces an App CRDT for replicating code updates across distributed nodes, demonstrated with minimal changes in AmbientTalk and LuAT frameworks.
Geo is a framework for optimizing graph pattern matching queries via rewrite rules and equality saturation that discovers equivalences and reduces costs by up to 99%.
A vision for a cloud SmartNIC that hides Parquet decoding costs by offloading parsing and filters directly on the network datapath, backed by DuckDB performance estimates.
citing papers explorer
-
Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models
KGFMs can predict links using observed half-links, with performance varying across four scenarios of half-link visibility in inference graphs.
-
Dynamic Software Updates using CRDTs
Introduces an App CRDT for replicating code updates across distributed nodes, demonstrated with minimal changes in AmbientTalk and LuAT frameworks.
-
Geo: A Query Rewrite Framework for Graph Pattern Mining
Geo is a framework for optimizing graph pattern matching queries via rewrite rules and equality saturation that discovers equivalences and reduces costs by up to 99%.
-
Should I Hide My Duck in the Lake?
A vision for a cloud SmartNIC that hides Parquet decoding costs by offloading parsing and filters directly on the network datapath, backed by DuckDB performance estimates.