Filters








764 Hits in 4.7 sec

GridVine: An Infrastructure for Peer Information Management

Philippe Cudre-Mauroux, Suchit Agarwal, Karl Aberer
2007 IEEE Internet Computing  
GridVine is a semantic overlay infrastructure based on a peer-to-peer (P2P) access structure.  ...  Built following the principle of data independence, it separates a logical layer -in which data, schemas, and schema mappings are managed -from a physical layer consisting of a structured P2P network supporting  ...  Resolving Queries in GridVine Indexing each triple based on three keys at the overlay layer lets us resolve complex higher-level queries at the semantic layer.  ... 
doi:10.1109/mic.2007.108 fatcat:x7c2dml6izd7fd4ix7iyulrlgm

Data Sharing in P2P Systems [chapter]

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
2009 Handbook of Peer-to-Peer Networking  
In this chapter, we survey P2P data sharing systems.  ...  All along, we focus on the evolution from simple file-sharing systems, with limited functionalities, to Peer Data Management Systems (PDMS) that support advanced applications with more sophisticated data  ...  Processing complex queries requires the employment of data access techniques which deal with the structure and semantics within data. Section 5 discusses complex queries in P2P systems.  ... 
doi:10.1007/978-0-387-09751-0_19 fatcat:i5pyj3c53rc6lfdxiqnconhsiq

A semantic-based P2P resource organization model R-Chord

Jie Liu, Hai Zhuge
2006 Journal of Systems and Software  
Experiments show that, compared to the Chord approach, the R-Chord approach is more flexible to support semantic-based queries and can significantly decrease the average visiting number of and visiting  ...  This paper proposes a semantic-based P2P resource organization model R-Chord by incorporating the Resource Space Model (RSM), the P2P Semantic Link Network Model (P2PSLN) and the DHT Chord protocol.  ...  Acknowledgements The research work was supported by the National Science Foundation of China (No. 60503047) and the National Basic Research Program of China (973 Project No. 2003CB317000).  ... 
doi:10.1016/j.jss.2006.03.001 fatcat:mghajvtqkballeizkhsf5pdcpy

Peer-to-peer data discovery in health centers

Maria Mirto, Massimo Cafaro, Giovanni Aloisio
2013 Proceedings of the 26th IEEE International Symposium on Computer-Based Medical Systems  
We describe an implementation of a distributed information service, that shares meta-EPRs and provides aggregation of relevant clinical information about patients based on a structured P2P overlay.  ...  A possible solution involves considering a simplification of data coming from different EPRs, in a structured schema, typically called a meta-EPR.  ...  Finally, the super-peers entities are connected in a structured P2P overlay.  ... 
doi:10.1109/cbms.2013.6627813 dblp:conf/cbms/MirtoCA13 fatcat:5rx5m2yw4rcwbchkzhtmqpf4de

Peer-to-peer management of XML data

Georgia Koloniari, Evaggelia Pitoura
2005 SIGMOD record  
However, sharing XML data imposes new challenges in p2p systems related to supporting advanced querying beyond simple keyword-based retrieval.  ...  In this paper, we focus on data management issues for processing XML data in a p2p setting, namely indexing, replication, clustering and query routing and processing.  ...  While structured queries work effectively with the inherent structure of XML data and can convey complex semantic meaning, they require from the user to know the schema (or part of the schema) of the XML  ... 
doi:10.1145/1083784.1083788 fatcat:smphtwg5gvfzzeztmkdembnuii

Research issues in Peer-to-Peer data management

Ozgur Ulusoy
2007 2007 22nd international symposium on computer and information sciences  
We also discuss some open research issues and directions regarding data management in P2P systems.  ...  Data management in Peer-to-Peer (P2P) systems is a complicated and challenging issue due to the scale of the network and highly transient population of peers.  ...  This work is partially supported by The Scientific and Technical Research Council of Turkey (TUBITAK) with grant number EEEAG-105E065.  ... 
doi:10.1109/iscis.2007.4456827 fatcat:3vnjt7f3dncwraqcx4gn3tkqcq

Improving Distributed Semantic Search with Hybrid Topology and Peer Recommendation [chapter]

Juan Li
2009 Studies in Computational Intelligence  
For queries which cannot be efficiently solved inside the community, a directory overlay built on Distributed Hash Table ( DHT) is used to assist the search.  ...  In this framework, peers dynamically perform topology adaptations to spontaneously create communities with similar semantic interests, so that search requests have a high probability of being satisfied  ...  Compared to search in pure structured P2P systems, our hybrid search system has inherent support for complex semantic query or partial match; in addition, the retrieved results are more relevant.  ... 
doi:10.1007/978-3-642-01209-9_8 fatcat:xqpa7x5qgbbv5aq32zqaf4wuuq

Distributed Search and Pattern Matching [chapter]

Reaz Ahmed, Raouf Boutaba
2009 Handbook of Peer-to-Peer Networking  
In such dynamic environment, users do not have the exact information about available resources. Queries are based on partial information. This mandates the search mechanism to be flexible.  ...  This chapter highlights the search requirements in large scale distributed systems and the ability of the existing distributed search techniques in satisfying these requirements.  ...  Squid [61] has been designed to support partial prefix matching and range queries on top of DHT-based structured P2P networks.  ... 
doi:10.1007/978-0-387-09751-0_16 fatcat:tnzjpctglvbcfmtdo5gsxr2o3i

A New Document Sharing System Based on a Semantic Hierarchical Peer-to-Peer Network

Anis Ismail, Aziz Barbar, Mohammad Hajjar, Mohamed Quafafou
2017 International Journal of Information and Education Technology  
We have developed a P2P application based on community architecture structured around Peers and Super-Peers.  ...  Example of P2P network of 50 nodes showing the ad hoc structure.  ...  The system AmbientDB [9] is based on the PDMS approach. Each Peer has its own schema and provides mappings with the global schema existing in the system.  ... 
doi:10.18178/ijiet.2017.7.5.901 fatcat:stp2pkqfxfb4jd23cbj6i5abtu

A New Document Sharing System Based on a Semantic Hierarchical Peer-to-Peer Network

Anis Ismail, Aziz Barbar, Mohammad Hajjar, Mohamed Quafafou
2017 International Journal of Engineering and Technology  
We have developed a P2P application based on community architecture structured around Peers and Super-Peers.  ...  Example of P2P network of 50 nodes showing the ad hoc structure.  ...  The system AmbientDB [9] is based on the PDMS approach. Each Peer has its own schema and provides mappings with the global schema existing in the system.  ... 
doi:10.7763/ijet.2017.v9.960 fatcat:yxy6ivoikjdahlzwmnc3ilikxi

GridVine: Building Internet-Scale Semantic Overlay Networks [chapter]

Karl Aberer, Philippe Cudré-Mauroux, Manfred Hauswirth, Tim Van Pelt
2004 Lecture Notes in Computer Science  
Thus our system provides a complete solution to the implementation of semantic overlay networks supporting both scalability and interoperability.  ...  The physical layer is used to implement various functions at the logical layer, including attribute-based search, schema management and schema mapping management.  ...  Schema inheritance and Semantic Gossiping are further described in Section 5. The P-Grid P2P System GridVine uses our P-Grid [2] P2P system as its physical layer.  ... 
doi:10.1007/978-3-540-30475-3_9 fatcat:5iqjpkynwfg2xlfavipy3ur3mm

Distributed databases and peer-to-peer databases

Angela Bonifati, Panos K. Chrysanthis, Aris M. Ouksel, Kai-Uwe Sattler
2008 SIGMOD record  
Thus, in the paper, by distinguishing between db-centric and P2P-centric features, we examine features common to these database systems as well as other ad-hoc features that solely characterize P2P databases  ...  Whereas a definition for a P2P database system can be readily provided, a comparison with the more established decentralized models, commonly referred to as distributed, federated and multidatabases, is  ...  Some of the ideas behind this paper have been conceived while the authors were at a panel in Dagstuhl, whose report can be found online at [9] .  ... 
doi:10.1145/1374780.1374781 fatcat:som4flba6ne5nmwvkiosaetoji

P2P Simulator for Queries Routing Using Data Mining

Anis Ismail, Aziz Barbar, Ziad Ismail
2011 International Journal of Database Management Systems  
The advantage of this knowledge based model is the robustness in Queries routing mechanism and scalability in P2P Network.  ...  An unstructured P2P system based on an organization of Peers around Super-Peers that are connected to Super-Super-Peer according to their semantic domains is considered.  ...  A challenging problem in a schema-based Peer-to-Peer (P2P) system is how to locate Peers that are relevant with respect to a given query with minimum query processing and answering time.  ... 
doi:10.5121/ijdms.2011.3301 fatcat:66wxxjl44bh5jpu4jautpoelli

Data Management in Large-Scale P2P Systems [chapter]

Patrick Valduriez, Esther Pacitti
2005 Lecture Notes in Computer Science  
In this paper, we discuss the issues of providing high-level data management services (schema, queries, replication, availability, etc.) in a P2P system.  ...  This work led to structured solutions based on distributed hash tables (DHT), e.g. CAN [24] and CHORD [27], or hybrid solutions with super-peers that index subsets of peers [32] .  ...  Martins for their many inputs and fruitful discussions in the context of the APPA project, and S. Abiteboul and I. Manolescu for fruitful discussions in the context of the MDP2P project.  ... 
doi:10.1007/11403937_9 fatcat:nwjttulmdffx7l5s3lw25qd4ta

Resource Discovery Based on VIRGO P2P Distributed DNS Framework [chapter]

Lican Huang
2008 Lecture Notes in Computer Science  
The DNS servers construct n-tuple overlay virtual hierarchical overlay network of VIRGO. With cached addresses of DNS servers, the overload of traffic in tree structure can be avoided.  ...  The time complexity, space complexity and message-cost of lookup with this framework is O(L), where L is the number of sub domains in Domain Name.  ...  These DNS servers construct n-tuple overlay virtual hierarchical overlay network. With cached addresses of DNS servers, the overload of traffic in tree structure can be avoided.  ... 
doi:10.1007/978-3-540-69389-5_57 fatcat:u2prgdyxhndmrasdaldhgessj4
« Previous Showing results 1 — 15 out of 764 results