Parallel sort-merge-join reasoning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Parallel sort-merge-join reasoning

Julien Subercaze
Christophe Gravier

Résumé

We present an in-memory, cross-platform, parallel reasoner for RDFS and RDFSPlus . Inferray uses carefully optimized hash-based join and sorting algorithms to perform parallel materialization. Designed to take advantage of the architecture of modern CPUs, Inferray exhibits a very good uses of cache and memory bandwidth. It offers state-of-theart performance on RDFS materialization, outperforms its counterparts on RDFSPlus and can be connected with Jena.
Fichier non déposé

Dates et versions

hal-01388099 , version 1 (26-10-2016)

Identifiants

  • HAL Id : hal-01388099 , version 1

Citer

Julien Subercaze, Christophe Gravier. Parallel sort-merge-join reasoning. 15th International Semantic Web Conference, Oct 2016, KOBE, Japan. ⟨hal-01388099⟩
88 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More