Paper Info
Title
Towards Parallel Processing of RDF Queries in DHTs
Abstract
Efficient RDF query evaluation is a requirement if the vision of a Semantic Web is to come true one day. Peer-to-peer (P2P) networks, specifically distributed hash tables (DHTs), could be one of the enabling technologies for the Semantic Web. Several DHT based RDF triple stores have been proposed but despite their differences they all process queries sequentially and hence leave an untapped potential for parallelism. This paper proposes and analyzes a scheme for parallel processing of RDF queries in DHTs. We describe a planning algorithm that attempts to reduce the response time of a query by considering parallel query plans prior to query execution. We provide an experimental evaluation of our approach and compare its results to an already existing scheme, i.e. the one of the BabelPeers project.
Year
DOI
Venue
2009
10.1007/978-3-642-03715-3_4
Globe
Keywords
Field
DocType
rdf queries,enabling technology,experimental evaluation,hash table,parallel query,parallel processing,rdf query,babelpeers project,semantic web,efficient rdf query evaluation,rdf triple store,distributed hash table
Query optimization,Web search query,RDF query language,Information retrieval,Computer science,Linked data,Web query classification,SPARQL,RDF Schema,RDF
Conference
Volume
ISSN
Citations 
5697
0302-9743
3
PageRank 
References 
Authors
0.36
18
3
Name
Order
Citations
PageRank
Björn Lohrmann1633.22
Dominic Battré225720.40
Odej Kao3106696.19