RDFS reasoning and query answering on top of DHTs

Zoi Kaoudi, Iris Miliaraki, Manolis Koubarakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

33 Citations (Scopus)

Abstract

We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. Scalable, distributed RDFS reasoning is an essential functionality for providing the scalability and performance that large-scale Semantic Web applications require. Our goal in this paper is to compare and evaluate two well-known approaches to RDFS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness. We also study the time-space trade-off exhibited by the algorithms analytically, and experimentally by evaluating our algorithms on PlanetLab.

Original languageEnglish
Title of host publicationThe Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings
Pages499-516
Number of pages18
DOIs
Publication statusPublished - 15 Dec 2008
Externally publishedYes
Event7th International Semantic Web Conference, ISWC 2008 - Karlsruhe, Germany
Duration: 26 Oct 200830 Oct 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5318 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Semantic Web Conference, ISWC 2008
CountryGermany
CityKarlsruhe
Period26/10/0830/10/08

Fingerprint

Reasoning
Query
Bamboo
Tables
Semantic Web
Scalability
Web Application
Correctness
Table
Trade-offs
Space-time
Evaluate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kaoudi, Z., Miliaraki, I., & Koubarakis, M. (2008). RDFS reasoning and query answering on top of DHTs. In The Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings (pp. 499-516). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5318 LNCS). https://doi.org/10.1007/978-3-540-88564-1-32

RDFS reasoning and query answering on top of DHTs. / Kaoudi, Zoi; Miliaraki, Iris; Koubarakis, Manolis.

The Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings. 2008. p. 499-516 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5318 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kaoudi, Z, Miliaraki, I & Koubarakis, M 2008, RDFS reasoning and query answering on top of DHTs. in The Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5318 LNCS, pp. 499-516, 7th International Semantic Web Conference, ISWC 2008, Karlsruhe, Germany, 26/10/08. https://doi.org/10.1007/978-3-540-88564-1-32
Kaoudi Z, Miliaraki I, Koubarakis M. RDFS reasoning and query answering on top of DHTs. In The Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings. 2008. p. 499-516. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-88564-1-32
Kaoudi, Zoi ; Miliaraki, Iris ; Koubarakis, Manolis. / RDFS reasoning and query answering on top of DHTs. The Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings. 2008. pp. 499-516 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{03932f0eeb0e4061ab4bb9c0701be8ac,
title = "RDFS reasoning and query answering on top of DHTs",
abstract = "We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. Scalable, distributed RDFS reasoning is an essential functionality for providing the scalability and performance that large-scale Semantic Web applications require. Our goal in this paper is to compare and evaluate two well-known approaches to RDFS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness. We also study the time-space trade-off exhibited by the algorithms analytically, and experimentally by evaluating our algorithms on PlanetLab.",
author = "Zoi Kaoudi and Iris Miliaraki and Manolis Koubarakis",
year = "2008",
month = "12",
day = "15",
doi = "10.1007/978-3-540-88564-1-32",
language = "English",
isbn = "3540885633",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "499--516",
booktitle = "The Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings",

}

TY - GEN

T1 - RDFS reasoning and query answering on top of DHTs

AU - Kaoudi, Zoi

AU - Miliaraki, Iris

AU - Koubarakis, Manolis

PY - 2008/12/15

Y1 - 2008/12/15

N2 - We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. Scalable, distributed RDFS reasoning is an essential functionality for providing the scalability and performance that large-scale Semantic Web applications require. Our goal in this paper is to compare and evaluate two well-known approaches to RDFS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness. We also study the time-space trade-off exhibited by the algorithms analytically, and experimentally by evaluating our algorithms on PlanetLab.

AB - We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. Scalable, distributed RDFS reasoning is an essential functionality for providing the scalability and performance that large-scale Semantic Web applications require. Our goal in this paper is to compare and evaluate two well-known approaches to RDFS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness. We also study the time-space trade-off exhibited by the algorithms analytically, and experimentally by evaluating our algorithms on PlanetLab.

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

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

U2 - 10.1007/978-3-540-88564-1-32

DO - 10.1007/978-3-540-88564-1-32

M3 - Conference contribution

SN - 3540885633

SN - 9783540885634

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 499

EP - 516

BT - The Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings

ER -