Query Processing in RDF/S-Based P2P Database Systems

Kokkinidis, George; Sidirourgos, Lefteris; Christophides, Vassilis

doi:10.1007/3-540-28347-1_4

Cited by 14 publications

(11 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Super-peers in the network are ar-ranged in a hypercube topology that allows for efficient broadcast and search. Kokkinidis et al [8 ] Cai and Frank [10 ] proposed a scalable RDF repository called RDFPeers in which a triple is stored at three places in a multi-attribute addressable network. They extended Chord [19 ] by applying hash functions to the subject, predicate and object values of the triple.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Building a Distributed Infrastructure for Scalable Triple Stores

Zhou

Hall

Roure

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Built specifically for the Semantic Web, triple stores are required to accommodate a large number of RDF triples and remain primarily centralized. As triple stores grow and evolve with time, there is a demanding need for scalable techniques to remove resource and performance bottlenecks in such systems. To this end, we propose a fully decentralized peer-to-peer architecture for large scale triple stores in which triples are maintained by individual stakeholders, and a semantics-directed search protocol, mediated by topology reorganization, for locating triples of interest. We test our design through simulations and results show anticipated improvements over existing techniques for distributed triple stores. In addition to engineering future large scale triple stores, our work will in particular benefit the federation of stand-alone triple stores of today to achieve desired scalability.

show abstract

Section: Related Workmentioning

confidence: 99%

“…RDF data files for query resolution (6), collects the result (7), and presents it to the user (9) through the user interface (8). As operating in a decentralized environment, S-RDF can provide access to the RDF data files via query languages of choice such as SPARQL 7 .…”

Section: Selecting a Software Architecturementioning

confidence: 99%

Building a Distributed Infrastructure for Scalable Triple Stores

Zhou

Hall

Roure

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…The integration of semantic correspondences into query processing as proposed by [73] is similar to our approach. RVL views [74] are used to describe participating sources.…”

Section: Related Workmentioning

confidence: 99%

Scalable distributed indexing and query processing over Linked Data

Karnstedt

Sattler

Hauswirth

2012

Journal of Web Semantics

View full text Add to dashboard Cite

“…In the same spirit the work in [13] presents preliminary results about the clustering of the workload on the real popular systems e-Donkey and Kazaa. Additionally, SQPeer is an extensive work on PDMS that share RDF data and they localize the query patterns using views [26].…”

Section: Related Workmentioning

confidence: 99%

A framework for semantic grouping in P2P databases

Kantere

Tsoumakos

Sellis

2008

Information Systems

View full text Add to dashboard Cite

Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network links to semantic relations between participants in order to assist in efficient resource discovery and information exchange. In this work, we propose a scheme that automates the process of creating schema synopses from semantic clusters of peers which own autonomous relational databases. The resulting mediated schemas can be used as global interfaces for relevant queries. Active nodes are able to initiate the group schema creation process, which produces a mediated schema representative of nodes with similar semantics. Group schemas are then propagated in the overlay and used as a single interface for relevant queries. This increases both the quality and the quantity of the retrieved answers and allows for fast discovery of interest groups by joining peers. As our experimental evaluations show, this method increases both the quality and the quantity of the retrieved answers and allows for faster discovery of semantic groups by joining peers.

show abstract

Query Processing in RDF/S-Based P2P Database Systems

Cited by 14 publications

References 29 publications

Building a Distributed Infrastructure for Scalable Triple Stores

Building a Distributed Infrastructure for Scalable Triple Stores

Scalable distributed indexing and query processing over Linked Data

A framework for semantic grouping in P2P databases

Contact Info

Product

Resources

About