Efficient Processing of SPARQL Joins in Memory by Dynamically Restricting Triple Patterns

Jinghua Groppe; Sven Groppe; Sebastian Ebers; Volker Linnemann

doi:10.1145/1529282.1529560

Efficient Processing of SPARQL Joins in Memory by Dynamically Restricting Triple Patterns

Jinghua Groppe, Sven Groppe, Sebastian Ebers, Volker Linnemann

Abstract

Since there are a lot of similar or common properties between RDF and relational databases and between SPARQL and SQL, many efforts focus on leveraging the research results of optimizing relational query languages for optimizing SPARQL queries. However, SPARQL has its own characteristics different from SQL, which are not fully exploited by existing work. Therefore, there is still much space for research on optimizing SPARQL queries. Based on the triple nature of RDF data, we create 7 indices to retrieve RDF data quickly; based on the SPARQL-specific properties and the 7 indices, we develop a new, efficient approach to computing join by dynamically restricting triple patterns. Our experimental results show the efficiency of our approach.

Originalsprache	Englisch
Titel	Proceedings of the 2009 ACM Symposium on Applied Computing
Seitenumfang	8
Erscheinungsort	New York, NY, USA
Herausgeber (Verlag)	ACM
Erscheinungsdatum	08.03.2009
Seiten	1231-1238
ISBN (Print)	978-1-60558-166-8
DOIs	https://doi.org/10.1145/1529282.1529560
Publikationsstatus	Veröffentlicht - 08.03.2009
Veranstaltung	24th Annual ACM Symposium on Applied Computing - Honolulu, USA / Vereinigte Staaten Dauer: 08.03.2009 → 12.03.2009 Konferenznummer: 78664

UN SDGs

Dieser Output leistet einen Beitrag zu folgendem(n) Ziel(en) für nachhaltige Entwicklung

SDG 3 – Gesundheit und Wohlergehen
SDG 9 – Industrie, Innovation und Infrastruktur
SDG 11 – Nachhaltige Städte und Gemeinschaften
SDG 12 – Verantwortungsvoller Konsum und Produktion

Strategische Forschungsbereiche und Zentren

Querschnittsbereich: Intelligente Systeme
Zentren: Zentrum für Künstliche Intelligenz Lübeck (ZKIL)

DFG-Fachsystematik

4.43-03 Sicherheit und Verlässlichkeit, Betriebs-, Kommunikations- und verteilte Systeme

Dokumente

10.1145/1529282.1529560

Weitere Links

https://www.scopus.com/pages/publications/72949103455

1 Abgeschlossen

Logisch und physikalisch optimierte Semantic Web Datenbank-Engine
Groppe, S. (Projektleiter*in (PI)) & Linnemann, V. (Beteiligte Person)
01.01.07 → 31.12.11
Projekt: DFG Einzelprojekte › DFG Einzelförderungen (Sachbeihilfen)

Zitieren

@inproceedings{c60fafe66be349daa7b6633d171d9fbc,

title = "Efficient Processing of SPARQL Joins in Memory by Dynamically Restricting Triple Patterns",

abstract = "Since there are a lot of similar or common properties between RDF and relational databases and between SPARQL and SQL, many efforts focus on leveraging the research results of optimizing relational query languages for optimizing SPARQL queries. However, SPARQL has its own characteristics different from SQL, which are not fully exploited by existing work. Therefore, there is still much space for research on optimizing SPARQL queries. Based on the triple nature of RDF data, we create 7 indices to retrieve RDF data quickly; based on the SPARQL-specific properties and the 7 indices, we develop a new, efficient approach to computing join by dynamically restricting triple patterns. Our experimental results show the efficiency of our approach. ",

author = "Jinghua Groppe and Sven Groppe and Sebastian Ebers and Volker Linnemann",

year = "2009",

month = mar,

day = "8",

doi = "10.1145/1529282.1529560",

language = "English",

isbn = "978-1-60558-166-8",

series = "Proceedings of the ACM Symposium on Applied Computing",

publisher = "ACM",

pages = "1231--1238",

booktitle = "Proceedings of the 2009 ACM Symposium on Applied Computing",

note = "24th Annual ACM Symposium on Applied Computing <br/>, SAC 2009 ; Conference date: 08-03-2009 Through 12-03-2009",

}

Groppe, J , Groppe, S, Ebers, S & Linnemann, V 2009, Efficient Processing of SPARQL Joins in Memory by Dynamically Restricting Triple Patterns. in Proceedings of the 2009 ACM Symposium on Applied Computing. Proceedings of the ACM Symposium on Applied Computing, ACM, New York, NY, USA, S. 1231-1238, 24th Annual ACM Symposium on Applied Computing
, Honolulu, Hawaii, USA / Vereinigte Staaten, 08.03.09. https://doi.org/10.1145/1529282.1529560

Efficient Processing of SPARQL Joins in Memory by Dynamically Restricting Triple Patterns. / Groppe, Jinghua ; Groppe, Sven; Ebers, Sebastian et al.
Proceedings of the 2009 ACM Symposium on Applied Computing. New York, NY, USA: ACM, 2009. S. 1231-1238 (Proceedings of the ACM Symposium on Applied Computing).

Publikation: Kapitel in Büchern/Berichten/Konferenzbänden › Konferenzbeitrag › Begutachtung

TY - GEN

T1 - Efficient Processing of SPARQL Joins in Memory by Dynamically Restricting Triple Patterns

AU - Groppe, Jinghua

AU - Groppe, Sven

AU - Ebers, Sebastian

AU - Linnemann, Volker

N1 - Conference code: 78664

PY - 2009/3/8

Y1 - 2009/3/8

N2 - Since there are a lot of similar or common properties between RDF and relational databases and between SPARQL and SQL, many efforts focus on leveraging the research results of optimizing relational query languages for optimizing SPARQL queries. However, SPARQL has its own characteristics different from SQL, which are not fully exploited by existing work. Therefore, there is still much space for research on optimizing SPARQL queries. Based on the triple nature of RDF data, we create 7 indices to retrieve RDF data quickly; based on the SPARQL-specific properties and the 7 indices, we develop a new, efficient approach to computing join by dynamically restricting triple patterns. Our experimental results show the efficiency of our approach.

AB - Since there are a lot of similar or common properties between RDF and relational databases and between SPARQL and SQL, many efforts focus on leveraging the research results of optimizing relational query languages for optimizing SPARQL queries. However, SPARQL has its own characteristics different from SQL, which are not fully exploited by existing work. Therefore, there is still much space for research on optimizing SPARQL queries. Based on the triple nature of RDF data, we create 7 indices to retrieve RDF data quickly; based on the SPARQL-specific properties and the 7 indices, we develop a new, efficient approach to computing join by dynamically restricting triple patterns. Our experimental results show the efficiency of our approach.

UR - https://www.scopus.com/pages/publications/72949103455

U2 - 10.1145/1529282.1529560

DO - 10.1145/1529282.1529560

M3 - Conference contribution

SN - 978-1-60558-166-8

T3 - Proceedings of the ACM Symposium on Applied Computing

SP - 1231

EP - 1238

BT - Proceedings of the 2009 ACM Symposium on Applied Computing

PB - ACM

CY - New York, NY, USA

T2 - 24th Annual ACM Symposium on Applied Computing <br/>

Y2 - 8 March 2009 through 12 March 2009

ER -

Efficient Processing of SPARQL Joins in Memory by Dynamically Restricting Triple Patterns

Abstract

UN SDGs

Strategische Forschungsbereiche und Zentren

DFG-Fachsystematik

Dokumente

Weitere Links

Fingerprint

Projekte

Logisch und physikalisch optimierte Semantic Web Datenbank-Engine

Zitieren