A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Mapping data in peer-to-peer systems: semantics and algorithmic issues
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Supporting executable mappings in model management
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
XML data integration in OGSA grids
DMG 2005 Proceedings of the First VLDB conference on Data Management in Grids
Semantic peer, here are the neighbors you want!
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Vague queries on peer-to-peer XML databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
We propose a novel peer-to-peer architecture, PARIS, aimed at exploiting the unprecedented amount of information available today on the Internet. In PARIS, the combination of decentralized semantic data integration with gossip-based (unstructured) overlay topology management and (structured) distributed hash tables provides the required level of flexibility, adaptability and scalability, and still allows to perform rich queries on a number of autonomous data sources. We describe the logical model that supports the architecture and show how its original topology is constructed. We also present the usage of the system in detail, in particular, the algorithms used to let new peers join the network and to execute queries on top of it.