Performance analysis and comparison for linked data index structure

Sun Yu Xiang, Yongju Lee

Research output: Contribution to journalArticlepeer-review

Abstract

With the development of semantic web and the rapid growth of data volume of RDF, the storage and retrieval of the large-scale RDF data have become a research hotspot. Therefore, it is an important issue how to the large-scale RDF data are stored, indexed, and queried. In this paper, we present a solution to store and query the large-scale RDF data by k-d tree and R*-tree, and analyze the strength and weakness of both techniques. We also propose an optimized scheme focus on the join query for adapting R*-tree.

Original languageEnglish
Pages (from-to)71-76
Number of pages6
JournalJP Journal of Heat and Mass Transfer
Volume15
Issue numberSpecial Issue 1
DOIs
StatePublished - Jun 2018

Keywords

  • DBpedia
  • K-d tree
  • Linked data
  • R*-tree
  • RDF
  • Semantic web
  • SPARQL

Fingerprint

Dive into the research topics of 'Performance analysis and comparison for linked data index structure'. Together they form a unique fingerprint.

Cite this