Pith. sign in

REVIEW 1 cited by

Hardware Acceleration for Knowledge Graph Processing: Challenges & Recent Developments

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.12173 v2 pith:CNDXWF65 submitted 2024-08-22 cs.IR cs.PF

classification cs.IRcs.PF
keywords hardwareknowledgegraphaccelerationdifferentrecentreviewsignificant
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Knowledge graphs (KGs) have achieved significant attention in recent years, particularly in the area of the Semantic Web as well as gaining popularity in other application domains such as data mining and search engines. Simultaneously, there has been enormous progress in the development of different types of heterogeneous hardware, impacting the way KGs are processed. The aim of this paper is to provide a systematic literature review of knowledge graph hardware acceleration. For this, we present a classification of the primary areas in knowledge graph technology that harnesses different hardware units for accelerating certain knowledge graph functionalities. We then extensively describe respective works, focusing on how KG related schemes harness modern hardware accelerators. Based on our review, we identify various research gaps and future exploratory directions that are anticipated to be of significant value both for academics and industry practitioners.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Higher-Order Graph Databases

    cs.DB 2025-06 conditional novelty 4.0 of 10

    Encoding higher-order structures as heterogeneous property graphs lets standard graph databases support hyperedges, node-tuples, and subgraphs; a Neo4j-based prototype, ACID discussion, complexity analysis, and a GNN ...

Pith tools