Decentralized Indexing over a Network of RDF Peers

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Abstract

Despite the prospect of a vast Web of interlinked data, the Semantic Web today mostly fails to meet its potential. One of the main problems it faces is rooted in its current architecture, which totally relies on the availability of the servers providing access to the data. These servers are subject to failures, which often results in situations where some data is unavailable. Recent advances have proposed decentralized peer-to-peer based architectures to alleviate this problem. However, for query processing these approaches mostly rely on flooding, a standard technique for peer-to-peer systems, which can easily result in very high network traffic and hence cause high query response times. To still enable efficient query processing in such networks, this paper proposes two indexing schemes, which in a decentralized fashion aim at efficiently finding nodes with relevant data for a given query: Locational Indexes and Prefix-Partitioned Bloom Filters. Our experiments show that such indexing schemes are able to considerably speed up query processing times compared to existing approaches.
Original languageEnglish
Title of host publicationThe Semantic Web - ISWC 2019
PublisherSpringer
Publication date2019
ISBN (Print)978-3-030-30792-9
ISBN (Electronic)978-3-030-30793-6
DOIs
Publication statusPublished - 2019
EventThe 18th International Semantic Web Conference, ISWC 2019 - Auckland, New Zealand
Duration: 26 Oct 201930 Oct 2019
Conference number: 18th
https://iswc2019.semanticweb.org/

Conference

ConferenceThe 18th International Semantic Web Conference, ISWC 2019
Number18th
CountryNew Zealand
CityAuckland
Period26/10/201930/10/2019
Internet address
SeriesLecture Notes in Computer Science
ISSN0302-9743

Fingerprint

Query processing
Servers
Semantic Web
Availability
Experiments

Cite this

Aebeloe, C., Montoya, G., & Hose, K. (2019). Decentralized Indexing over a Network of RDF Peers. In The Semantic Web - ISWC 2019 Springer. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-030-30793-6_1
Aebeloe, Christian ; Montoya, Gabriela ; Hose, Katja. / Decentralized Indexing over a Network of RDF Peers. The Semantic Web - ISWC 2019. Springer, 2019. (Lecture Notes in Computer Science).
@inproceedings{e255ddad9b734cab884625322949797e,
title = "Decentralized Indexing over a Network of RDF Peers",
abstract = "Despite the prospect of a vast Web of interlinked data, the Semantic Web today mostly fails to meet its potential. One of the main problems it faces is rooted in its current architecture, which totally relies on the availability of the servers providing access to the data. These servers are subject to failures, which often results in situations where some data is unavailable. Recent advances have proposed decentralized peer-to-peer based architectures to alleviate this problem. However, for query processing these approaches mostly rely on flooding, a standard technique for peer-to-peer systems, which can easily result in very high network traffic and hence cause high query response times. To still enable efficient query processing in such networks, this paper proposes two indexing schemes, which in a decentralized fashion aim at efficiently finding nodes with relevant data for a given query: Locational Indexes and Prefix-Partitioned Bloom Filters. Our experiments show that such indexing schemes are able to considerably speed up query processing times compared to existing approaches.",
author = "Christian Aebeloe and Gabriela Montoya and Katja Hose",
year = "2019",
doi = "https://doi.org/10.1007/978-3-030-30793-6_1",
language = "English",
isbn = "978-3-030-30792-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
booktitle = "The Semantic Web - ISWC 2019",
address = "Germany",

}

Aebeloe, C, Montoya, G & Hose, K 2019, Decentralized Indexing over a Network of RDF Peers. in The Semantic Web - ISWC 2019. Springer, Lecture Notes in Computer Science, The 18th International Semantic Web Conference, ISWC 2019, Auckland, New Zealand, 26/10/2019. https://doi.org/10.1007/978-3-030-30793-6_1

Decentralized Indexing over a Network of RDF Peers. / Aebeloe, Christian; Montoya, Gabriela; Hose, Katja.

The Semantic Web - ISWC 2019. Springer, 2019. (Lecture Notes in Computer Science).

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

TY - GEN

T1 - Decentralized Indexing over a Network of RDF Peers

AU - Aebeloe, Christian

AU - Montoya, Gabriela

AU - Hose, Katja

PY - 2019

Y1 - 2019

N2 - Despite the prospect of a vast Web of interlinked data, the Semantic Web today mostly fails to meet its potential. One of the main problems it faces is rooted in its current architecture, which totally relies on the availability of the servers providing access to the data. These servers are subject to failures, which often results in situations where some data is unavailable. Recent advances have proposed decentralized peer-to-peer based architectures to alleviate this problem. However, for query processing these approaches mostly rely on flooding, a standard technique for peer-to-peer systems, which can easily result in very high network traffic and hence cause high query response times. To still enable efficient query processing in such networks, this paper proposes two indexing schemes, which in a decentralized fashion aim at efficiently finding nodes with relevant data for a given query: Locational Indexes and Prefix-Partitioned Bloom Filters. Our experiments show that such indexing schemes are able to considerably speed up query processing times compared to existing approaches.

AB - Despite the prospect of a vast Web of interlinked data, the Semantic Web today mostly fails to meet its potential. One of the main problems it faces is rooted in its current architecture, which totally relies on the availability of the servers providing access to the data. These servers are subject to failures, which often results in situations where some data is unavailable. Recent advances have proposed decentralized peer-to-peer based architectures to alleviate this problem. However, for query processing these approaches mostly rely on flooding, a standard technique for peer-to-peer systems, which can easily result in very high network traffic and hence cause high query response times. To still enable efficient query processing in such networks, this paper proposes two indexing schemes, which in a decentralized fashion aim at efficiently finding nodes with relevant data for a given query: Locational Indexes and Prefix-Partitioned Bloom Filters. Our experiments show that such indexing schemes are able to considerably speed up query processing times compared to existing approaches.

U2 - https://doi.org/10.1007/978-3-030-30793-6_1

DO - https://doi.org/10.1007/978-3-030-30793-6_1

M3 - Article in proceeding

SN - 978-3-030-30792-9

T3 - Lecture Notes in Computer Science

BT - The Semantic Web - ISWC 2019

PB - Springer

ER -

Aebeloe C, Montoya G, Hose K. Decentralized Indexing over a Network of RDF Peers. In The Semantic Web - ISWC 2019. Springer. 2019. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-030-30793-6_1