Scalable Peer-to-Peer RDF Query Algorithm

  • Denis Ranger
  • Jean-François Cloutier
Conference paper

DOI: 10.1007/11581116_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3807)
Cite this paper as:
Ranger D., Cloutier JF. (2005) Scalable Peer-to-Peer RDF Query Algorithm. In: Dean M. et al. (eds) Web Information Systems Engineering – WISE 2005 Workshops. WISE 2005. Lecture Notes in Computer Science, vol 3807. Springer, Berlin, Heidelberg

Abstract

The execution of complex queries across peers in a timely and resource efficient manner is a difficult problem in peer-to-peer networking. A novel approach to distributed RDF queries uses a two-phased process: establish a contributor pipeline to get the raw data, then form a reader pipeline to read the results. Pipelines are created efficiently using a publish/subscribe mechanism (Pastry’s Scribe framework [1]).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Denis Ranger
    • 1
  • Jean-François Cloutier
    • 1
  1. 1.Mind-Alliance Systems LLCUSA

Personalised recommendations