Paper Info
Title
Top k RDF query evaluation in structured P2P networks
Abstract
Berners-Lee's vision of the Semantic Web describes the idea of providing machine readable and processable information using key technologies such as ontologies and automated reasoning in order to create intelligent agents. The prospective amount of machine readable information available in the future will be large. Thus, heterogeneity and scalability will be central issues, rendering exhaustive searches and central storage of data infeasible. This paper presents a scalable peer-to-peer based approach to distributed querying of Semantic Web information that allows ordering of entries in result sets and limiting the size of result sets which is necessary to prevent results with millions of matches. The system relies on the graph-based W3C standard Resource Description Framework (RDF) for knowledge description. Thereby, it enables queries on large, distributed RDF graphs.
Year
DOI
Venue
2006
10.1007/11823285_105
Euro-Par
Keywords
Field
DocType
central issue,p2p network,central storage,processable information,top k rdf query,result set,automated reasoning,rdf graph,machine readable information,machine readable,semantic web,semantic web information,intelligent agent,resource description framework,exhaustive search
RDF query language,Information retrieval,Computer science,Linked data,Semantic Web,Semantic analytics,SPARQL,RDF/XML,RDF Schema,RDF,Database,Distributed computing
Conference
ISBN
Citations 
PageRank 
3-540-37783-2
7
0.58
References 
Authors
10
3
Name
Order
Citations
PageRank
Dominic Battré125720.40
Felix Heine21128.73
Odej Kao3106696.19