Lune

VLDB2026顶会

Sankofa: Online Query-adaptive Dynamic Graph Summaries

Ama Bembua Bainson, Kasper Overgaard Mortensen, Klim Zaporojets, Davide Mottin, Panagiotis Karras

2026年份
1被引次数

摘要

Knowledge Graphs (KGs) model semantic relationships between entities and are widely used in tasks such as question answering, recommendation, and large language model training. As KGs grow to billions of triples, storing and querying them on local devices becomes infeasible and also raises privacy concerns. KG summarization methods produce compact representations, yet existing methods are either static or not attuned to user interests. In this paper, we propose Sankofa, a query-adaptive, incremental, and online KG summarization method. Sankofa maintains personalized summaries on-device by incrementally updating them in response to new queries and data using a random-walk-based adaptation of node-centric Personalized PageRank, efficiently identifying the most relevant nodes while bounding summary size. We provide formal guarantees for our PPR approximation and demonstrate experimentally that Sankofa outperforms existing personalized KG summarization techniques in speed and accuracy, enabling adaptive, privacy-preserving KG summaries that evolve with user interests on dynamic knowledge graphs.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

它引用的顶会 Paper11

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖