A distributed inverted indexing scheme for large-scale RDF data

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the development of the Linked Data project, enormous RDF data have been published on the Web. A scalable system is required to provide an efficient retrieval for large-scale RDF data. This paper presents a distributed inverted indexing scheme for large-scale RDF data. A scalable inverted index is built using the underlying data structure of Cassandra which is a distributed key-value storage system. We optimize the indexing scheme with the characteristics of RDF data model to effectively support the fast keyword search. The loading, encoding and indexing procedures are implemented for RDF data simultaneously using the MapReduce framework. The experimental results show that our indexing scheme can effectively support keyword retrieval for large-scale RDF data. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, X., Wang, X., Shi, H., Sheng, Z., & Feng, Z. (2012). A distributed inverted indexing scheme for large-scale RDF data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7419 LNCS, pp. 151–161). https://doi.org/10.1007/978-3-642-33050-6_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free