Abstract—Recently, a very pragmatic approach towards achieving the Semantic Web has gained some traction with Linked Data. While many standards, methods, and technologies are applicable for Linked Data, there are still a number of open problems in the area of Linked Data. In this paper, we investigate how Linked Data are stored, indexed, and queried. We present an MDH* structure capable of efficiently storing, indexing, and querying Linked Data. The goal of the MDH* is to support efficient join query processing with a compact storage layout. We evaluate the MDH* with existing methods on a synthetic RDF dataset. The experimental results show that our method performs better in terms of both the join response time and the amount of storage compared to existing methods.

Index Terms—linked data, RDF triples, multidimensional histograms, occurrences, join queries, index structures

Cite: Yongju Lee, "MDH*: Multidimensional Histograms for Linked Data Queries," Lecture Notes on Information Theory, Vol. 2, No. 3, pp. 243-248, September 2014. doi: 10.12720/lnit.2.3.243-248