RDF Data Indexing and Retrieval: A survey of Peer-to-Peer based solutions

In this work, we propose the organization of document storage and retrieval in a Corporate Semantic Web (CSW), based on two procedures: First, we solve content location and built

The problem of finding all certain answers ans(q, P, D) to an arbitrary graph pattern query q, for a given RDF Peer System P and a stored database D, has PTIME data complexity.. Due

Two important properties that should be targeted as much as possible when designing content dispatching algorithm are: (i) the peers should be equally popular with the overall

This paper presents different strategies for constructing peer-to-peer networks for a music recommender application based on

To make it more efficient, we suggest to use half-life, which is the time that the number of online tasks decrease from the value at starting point to its nth half, to indirectly

To meet these requirements, we propose the creation of Smart Actor s as nodes and therefore as core building blocks of the peer- to-peer agile value creation network.. Therefore,

In the first one there are some peers owning all the chunks (roots) composing a file and the aim is to study the time required to ensure that every chunk is spread out on the

plots (black dots), with Hidden Markov model states (HMM, colored bands) (b) State duration distributions: probability distributions of being in states of given durations in