Triplifying equivalence set graphs

Luigi Asprino, Wouter Beek, Paolo Ciancarini, Frank van Harmelen, Valentina Presutti

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

In order to conduct large-scale semantic analyses, it is necessary to calculate the deductive closure of very large hierarchical structures. Unfortunately, contemporary reasoners cannot be applied at this scale, unless they rely on expensive hardware such as a multi-node in-memory cluster. In order to handle large-scale semantic analyses on commodity hardware such as regular laptops we introduced [1] a novel data structure called Equivalence Set Graph (ESG). An ESG allows to specify compact views of large RDF graphs thus easing the accomplishment of statistical observations like the number of concepts defined in a graph, the shape of ontological hierarchies etc. ESGs are built by a procedure presented in [1] that delivers graphs as a set of maps storing nodes and edges. In this demo paper (i) we show how facts entailed by an ESG and the graph itself can be specified in RDF following a novel introduced ontology; and, (ii) we present two datasets resulting from the triplification of two ESG graphs (one for classes and one for properties).

Original languageEnglish
Title of host publicationISWC 2019 Satellites
Subtitle of host publication Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, Industry, and Outrageous Ideas) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 26-30, 2019
EditorsMari Carmen Suárez-Figueroa, Gong Cheng, Anna Lisa Gentile, Christophe Guéret, Maria Keet, Abraham Bernstein
PublisherCEUR-WS
Pages253-256
Number of pages4
Publication statusPublished - Oct 2019
Event2019 ISWC Satellite Tracks (Posters and Demonstrations, Industry, and Outrageous Ideas), ISWC 2019-Satellites - Auckland, New Zealand
Duration: 26 Oct 201930 Oct 2019

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR Workshop Proceedings
Volume2456
ISSN (Print)1613-0073

Conference

Conference2019 ISWC Satellite Tracks (Posters and Demonstrations, Industry, and Outrageous Ideas), ISWC 2019-Satellites
CountryNew Zealand
CityAuckland
Period26/10/1930/10/19

Fingerprint

Semantics
Computer hardware
Ontology
Data structures
Hardware
Data storage equipment

Keywords

  • Empirical Semantics
  • Linked Open Data
  • Semantic Web

Cite this

Asprino, L., Beek, W., Ciancarini, P., van Harmelen, F., & Presutti, V. (2019). Triplifying equivalence set graphs. In M. C. Suárez-Figueroa, G. Cheng, A. L. Gentile, C. Guéret, M. Keet, & A. Bernstein (Eds.), ISWC 2019 Satellites: Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, Industry, and Outrageous Ideas) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 26-30, 2019 (pp. 253-256). (CEUR Workshop Proceedings; Vol. 2456). CEUR-WS.
Asprino, Luigi ; Beek, Wouter ; Ciancarini, Paolo ; van Harmelen, Frank ; Presutti, Valentina. / Triplifying equivalence set graphs. ISWC 2019 Satellites: Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, Industry, and Outrageous Ideas) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 26-30, 2019. editor / Mari Carmen Suárez-Figueroa ; Gong Cheng ; Anna Lisa Gentile ; Christophe Guéret ; Maria Keet ; Abraham Bernstein. CEUR-WS, 2019. pp. 253-256 (CEUR Workshop Proceedings).
@inproceedings{d61224ba26cc49b3afac19b663ceaf3a,
title = "Triplifying equivalence set graphs",
abstract = "In order to conduct large-scale semantic analyses, it is necessary to calculate the deductive closure of very large hierarchical structures. Unfortunately, contemporary reasoners cannot be applied at this scale, unless they rely on expensive hardware such as a multi-node in-memory cluster. In order to handle large-scale semantic analyses on commodity hardware such as regular laptops we introduced [1] a novel data structure called Equivalence Set Graph (ESG). An ESG allows to specify compact views of large RDF graphs thus easing the accomplishment of statistical observations like the number of concepts defined in a graph, the shape of ontological hierarchies etc. ESGs are built by a procedure presented in [1] that delivers graphs as a set of maps storing nodes and edges. In this demo paper (i) we show how facts entailed by an ESG and the graph itself can be specified in RDF following a novel introduced ontology; and, (ii) we present two datasets resulting from the triplification of two ESG graphs (one for classes and one for properties).",
keywords = "Empirical Semantics, Linked Open Data, Semantic Web",
author = "Luigi Asprino and Wouter Beek and Paolo Ciancarini and {van Harmelen}, Frank and Valentina Presutti",
year = "2019",
month = "10",
language = "English",
series = "CEUR Workshop Proceedings",
publisher = "CEUR-WS",
pages = "253--256",
editor = "Su{\'a}rez-Figueroa, {Mari Carmen} and Gong Cheng and Gentile, {Anna Lisa} and Christophe Gu{\'e}ret and Maria Keet and Abraham Bernstein",
booktitle = "ISWC 2019 Satellites",

}

Asprino, L, Beek, W, Ciancarini, P, van Harmelen, F & Presutti, V 2019, Triplifying equivalence set graphs. in MC Suárez-Figueroa, G Cheng, AL Gentile, C Guéret, M Keet & A Bernstein (eds), ISWC 2019 Satellites: Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, Industry, and Outrageous Ideas) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 26-30, 2019. CEUR Workshop Proceedings, vol. 2456, CEUR-WS, pp. 253-256, 2019 ISWC Satellite Tracks (Posters and Demonstrations, Industry, and Outrageous Ideas), ISWC 2019-Satellites, Auckland, New Zealand, 26/10/19.

Triplifying equivalence set graphs. / Asprino, Luigi; Beek, Wouter; Ciancarini, Paolo; van Harmelen, Frank; Presutti, Valentina.

ISWC 2019 Satellites: Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, Industry, and Outrageous Ideas) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 26-30, 2019. ed. / Mari Carmen Suárez-Figueroa; Gong Cheng; Anna Lisa Gentile; Christophe Guéret; Maria Keet; Abraham Bernstein. CEUR-WS, 2019. p. 253-256 (CEUR Workshop Proceedings; Vol. 2456).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Triplifying equivalence set graphs

AU - Asprino, Luigi

AU - Beek, Wouter

AU - Ciancarini, Paolo

AU - van Harmelen, Frank

AU - Presutti, Valentina

PY - 2019/10

Y1 - 2019/10

N2 - In order to conduct large-scale semantic analyses, it is necessary to calculate the deductive closure of very large hierarchical structures. Unfortunately, contemporary reasoners cannot be applied at this scale, unless they rely on expensive hardware such as a multi-node in-memory cluster. In order to handle large-scale semantic analyses on commodity hardware such as regular laptops we introduced [1] a novel data structure called Equivalence Set Graph (ESG). An ESG allows to specify compact views of large RDF graphs thus easing the accomplishment of statistical observations like the number of concepts defined in a graph, the shape of ontological hierarchies etc. ESGs are built by a procedure presented in [1] that delivers graphs as a set of maps storing nodes and edges. In this demo paper (i) we show how facts entailed by an ESG and the graph itself can be specified in RDF following a novel introduced ontology; and, (ii) we present two datasets resulting from the triplification of two ESG graphs (one for classes and one for properties).

AB - In order to conduct large-scale semantic analyses, it is necessary to calculate the deductive closure of very large hierarchical structures. Unfortunately, contemporary reasoners cannot be applied at this scale, unless they rely on expensive hardware such as a multi-node in-memory cluster. In order to handle large-scale semantic analyses on commodity hardware such as regular laptops we introduced [1] a novel data structure called Equivalence Set Graph (ESG). An ESG allows to specify compact views of large RDF graphs thus easing the accomplishment of statistical observations like the number of concepts defined in a graph, the shape of ontological hierarchies etc. ESGs are built by a procedure presented in [1] that delivers graphs as a set of maps storing nodes and edges. In this demo paper (i) we show how facts entailed by an ESG and the graph itself can be specified in RDF following a novel introduced ontology; and, (ii) we present two datasets resulting from the triplification of two ESG graphs (one for classes and one for properties).

KW - Empirical Semantics

KW - Linked Open Data

KW - Semantic Web

UR - http://www.scopus.com/inward/record.url?scp=85073252069&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073252069&partnerID=8YFLogxK

M3 - Conference contribution

T3 - CEUR Workshop Proceedings

SP - 253

EP - 256

BT - ISWC 2019 Satellites

A2 - Suárez-Figueroa, Mari Carmen

A2 - Cheng, Gong

A2 - Gentile, Anna Lisa

A2 - Guéret, Christophe

A2 - Keet, Maria

A2 - Bernstein, Abraham

PB - CEUR-WS

ER -

Asprino L, Beek W, Ciancarini P, van Harmelen F, Presutti V. Triplifying equivalence set graphs. In Suárez-Figueroa MC, Cheng G, Gentile AL, Guéret C, Keet M, Bernstein A, editors, ISWC 2019 Satellites: Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, Industry, and Outrageous Ideas) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 26-30, 2019. CEUR-WS. 2019. p. 253-256. (CEUR Workshop Proceedings).