Two-step RDF query processing for Linked Data

Yongju Lee, Changsu Kim

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

Abstract

Since RDF triples are modeled as graphs, we cannot directly adopt existing solutions from relational databases and XML technologies. Thus, there are still a number of open problems in the area of Linked Data. We present a hybrid method between centralized and distributed approaches. By using auxiliary indexes based on the MBB approximation, our approach can retrieve distributed Linked Data efficiently. The goal of our approach is to support efficient join query processing by quickly pruning unnecessary scanning data.

Original languageEnglish
Title of host publicationRCIS 2017 - 11th IEEE International Conference on Research Challenges in Information Science - Conference Proceedings
EditorsOscal Pastor, Haralambos Mouratidis, Said Assar
PublisherIEEE Computer Society
Pages459-460
Number of pages2
ISBN (Electronic)9781509054763
DOIs
StatePublished - 23 Jun 2017
Event11th IEEE International Conference on Research Challenges in Information Science - RCIS 2017 - Brighton, United Kingdom
Duration: 10 May 201712 May 2017

Publication series

NameProceedings - International Conference on Research Challenges in Information Science
ISSN (Print)2151-1349
ISSN (Electronic)2151-1357

Conference

Conference11th IEEE International Conference on Research Challenges in Information Science - RCIS 2017
Country/TerritoryUnited Kingdom
CityBrighton
Period10/05/1712/05/17

Keywords

  • index structure
  • Linked Data
  • multidimensional histograms
  • RDF triples
  • SPARQL query

Fingerprint

Dive into the research topics of 'Two-step RDF query processing for Linked Data'. Together they form a unique fingerprint.

Cite this