Adapting Knowledge Graphs to Edge Computing Devices.

Joffrey de Oliveira,Christophe Callé,Olivier Curé

2023 IEEE International Conference on Big Data (BigData)(2023)

引用 0|浏览0
暂无评分
摘要
The emergence of increasingly powerful and inexpensive single-board computers has motivated a great deal of work in the field of edge computing. We believe that knowledge graphs will contribute to intelligent edge computing. This requires the ability to efficiently answer queries requiring inferences performed with minimal knowledge accessible on a device at the edge of the network. In this work, we determine the minimum size of the knowledge graph that an edge device needs based on the analysis of its query workload. In the context of a succinct data structures-based store, we also present an incremental update of this knowledge graph when new queries are introduced into the environment. We demonstrate the effectiveness of our solution on real use cases encountered by our industrial partner.
更多
查看译文
关键词
Edge Computing,Edge Devices,Graph Size,Worst Case,Selection Operator,Domain Experts,Subject And Object,Rank Value,Most Significant Bit,Query Set,Binary Search,Original Graph,Part Of The Graph,Entire Graph,Balanced Tree,Resource Description Framework,Cache Misses,Graph Pattern,SPARQL Query,Triple Store
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要