Filters








3,260 Hits in 5.7 sec

Utilizing XML Clustering for Efficient XML Data Management on P2P Networks [chapter]

Panagiotis Antonellis, Christos Makris, Nikos Tsirakis
2009 Lecture Notes in Computer Science  
In order to handle this problem we describe an XML P2P system that efficiently distributes a set of clustered XML documents in a P2P network in order to speed-up user queries.  ...  The novelty of the proposed system lies in the efficient distribution of the XML documents and the construction of an appropriate virtual index on top of the network peers.  ...  Acknowledgements Panagiotis Antonellis' work was supported in part by the Hellenic State Scholarships Foundation (IKY).  ... 
doi:10.1007/978-3-642-03573-9_6 fatcat:5vyprs3rq5adpbxftzjbrmafd4

Modeling Peer-To-Peer Networks With Interest-Based Clusters

Bertalan Forstner, Dr. Hassan Charaf
2007 Zenodo  
In the world of Peer-to-Peer (P2P) networking different protocols have been developed to make the resource sharing or information retrieval more efficient.  ...  However, this transformation causes high clustering in the network that decreases the number of nodes reached, therefore the probability of finding a document is also decreased.  ...  In the case of SemPeer not only the high connectedness of the neighbors causes a problem as well as some other kinds of links: first, the links backward in the propagation tree; second, links between nodes  ... 
doi:10.5281/zenodo.1081323 fatcat:ft67pypa2ngnffmcmqtzzgpdpy

Emerging semantic communities in peer web search

R. Akavipat, L.-S. Wu, F. Menczer, A.G. Maguitman
2006 Proceedings of the international workshop on Information retrieval in peer-to-peer networks - P2PIR '06  
For the network to be functional, its dynamic communication topology must match the semantic clustering of peers.  ...  We introduce two criteria to evaluate a peer search network based on the concept of semantic locality: first, the "smallworld" topology of the network; second, we use topical semantic similarity to monitor  ...  Work supported in part by NSF Career Grant IIS-0348940 to FM.  ... 
doi:10.1145/1183579.1183581 fatcat:lcrtvp776vdelpzisbkt2gydji

DPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks [chapter]

Dyce Jing Zhao, Dik Lun Lee, Qiong Luo
2006 Lecture Notes in Computer Science  
In this paper, we describe an efficient and scalable technique to support partialmatch queries on peer-to-peer networks.  ...  node in the network.  ...  When a peer leaves the network, it hands its foreign indices and query history to one of its neighbors in the cluster.  ... 
doi:10.1007/11687238_32 fatcat:pr6zzy7utjgmbfxibn2r5gmala

A research agenda for query processing in large-scale peer data management systems

Katja Hose, Armin Roth, André Zeitz, Kai-Uwe Sattler, Felix Naumann
2008 Information Systems  
In this article we first survey the state of the art on peer data management: We classify PDMS by characteristics concerning their system model, their semantics, their query planning schemes, and their  ...  Peers are interconnected by schema mappings, which guide the rewriting of queries between the heterogeneous schemata, and thus form a P2P-like network.  ...  As proposed in [24] the idea to create clusters of peers can be applied in the PDMS context as well. However, this requires that peers are willing to cooperate to build these clusters.  ... 
doi:10.1016/j.is.2008.01.012 fatcat:4snavtujrvhnlmhg2r3jxgabzm

Intelligent query processing in P2P networks: Semantic issues and routing algorithms

A.L. Nicolini, C.M. Lorenzetti, A.G. Maguitman, C.I. Chesñevar
2019 Computer Science and Information Systems  
A general comparative analysis is included, associated with a taxonomy of P2P networks based on their degree of decentralization and the different approaches adopted to exploit the available semantic aspects  ...  Such features are usually stored in auxiliary data structures (tables, matrices, etc.), which provide an extra knowledge engineering layer on top of the network, resulting in an added semantic value for  ...  We want to thank the reviewers who provided helpful suggestions and insights for improving the original version of the article.  ... 
doi:10.2298/csis180411002n fatcat:3sirwuryxrchhhh4vg553ib2bu

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

Juan Li
2009 Studies in Computational Intelligence  
Recommendation from peers of the same community is employed to extract only semantically related results thus improving the precision.  ...  In this paper, we propose a novel framework for discovery Semantic Web data in large-scale distributed networks.  ...  To support flexible complex queries, many P2P systems [11, 12] use flooding or maintain a broadcast structure, such as a tree or a super cube, to propagate the queries to the network.  ... 
doi:10.1007/978-3-642-01209-9_8 fatcat:xqpa7x5qgbbv5aq32zqaf4wuuq

Summary management in P2P systems

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient.  ...  Our performance evaluation shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance.  ...  As mentioned in Section 6.1.2, if we choose to propagate the query only to the set V = PQ ∩ P f resh we eliminate the possible false positives in query results.  ... 
doi:10.1145/1352431.1352438 fatcat:rusm3ogg2zanrmigjycqy2crmi

Summary management in P2P systems

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient.  ...  Our performance evaluation shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance.  ...  As mentioned in Section 6.1.2, if we choose to propagate the query only to the set V = PQ ∩ P f resh we eliminate the possible false positives in query results.  ... 
doi:10.1145/1353343.1353350 dblp:conf/edbt/HayekRVM08 fatcat:nqoijzrzjrbfhdlrkpcyem6yem

Improving peer-to-peer search performance through intelligent social search

Stephen J.H. Yang, Jia Zhang, Leon Lin, Jeffrey J.P. Tsai
2009 Expert systems with applications  
In such a P2P network, a search query is propagated along the social groups in the overlay social network.  ...  The interactions between the peers in the P2P network are used to incrementally build the social relationships between the peers in the associated social groups.  ...  If the query is not satisfied, the super-peer forwards the query to its connected super-peers. Thus, the superpeer technique eliminates some performance overheads of a primitive P2P network.  ... 
doi:10.1016/j.eswa.2009.01.045 fatcat:f7476rakhzgwlpu4fuo6djgxvq

Managing Linguistic Data Summaries in Advanced P2P Applications [chapter]

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
2009 Handbook of Peer-to-Peer Networking  
A query processing mechanism, which relies on summary querying, is then proposed to demonstrate the benefits that might be obtained from summary exploitation. 1 1 Patient day: number of days spent in the  ...  As the amount of stored data increases, data localization techniques become no longer sufficient in P2P systems.  ...  In [13] , a semantic-based content search consists in combining VSM to Latent Semantic Index (LSI) model to find semantically relevant documents in a P2P network.  ... 
doi:10.1007/978-0-387-09751-0_20 fatcat:fsbeo6paq5bnjlgltuze6zayfu

PeerSum: a summary service for P2P applications

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib, Jean‐Marc Pierson
2008 International Journal of Pervasive Computing and Communications  
Second, as semantic indexes, they support locating relevant nodes based on data content. Our main contribution is to define a summary model for P2P systems, and the algorithms for summary management.  ...  Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient.  ...  In [12] , a semantic-based content search consists in combining VSM to Latent Semantic Index (LSI) model to find semantically relevant documents in a P2P network.  ... 
doi:10.1108/17427370810932150 fatcat:u35bacvxgrf73k7jchxk6vj7bi

Secure and Privacy-Aware Searching in Peer-to-Peer Networks [chapter]

Jaydip Sen
2012 Lecture Notes in Computer Science  
The existing peer-to-peer networks have several problems such as fake content distribution, free riding, white-washing and poor search scalability, lack of a robust trust model and absence of user privacy  ...  Simulation results demonstrate that the proposed scheme provides efficient searching to good peers while penalizing the malicious peers by increasing their search times as the network topology stabilizes  ...  Fig. 10 . 10 Overhead of trust query propagation for 10% and 20% malicious peers in the network Figure 11 . 11 Clustering coefficients for different percentages of malicious peers.  ... 
doi:10.1007/978-3-642-28879-1_6 fatcat:7vftybl3hzcynlnwgxpcmiz5i4

Distributed content-based visual information retrieval system on peer-to-peer networks

Irwin King, Cheuk Hang Ng, Ka Cheung Sia
2004 ACM Transactions on Information Systems  
In this article, we present our design and implementation of DISCOVIR: DIStributed COntent-based Visual Information Retrieval system using the Peer-to-Peer (P2P) Network.  ...  Specifically, we propose a Firework Query Model for distributed information retrieval, which aims to reduce the network traffic of query passing in the network.  ...  ACKNOWLEDGMENTS The authors would like to thank the reviewers for their valuable comments and suggestions.  ... 
doi:10.1145/1010614.1010619 fatcat:hphx5x44xbfz5dolgk7en65qlm

Metric-Based Similarity Search in Unstructured Peer-to-Peer Systems [chapter]

Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis
2012 Lecture Notes in Computer Science  
We propose the construction of metric routing indices suitable for distributed similarity search in metric spaces.  ...  We study the performance of the proposed framework using both synthetic and real data demonstrate its scalability over a wide range of experimental setups.  ...  The experimental results show that our approach performs efficiently in all cases, while the performance of our framework scales with all network and dataset parameters.  ... 
doi:10.1007/978-3-642-28148-8_2 fatcat:m3ni4vmstfdptbfn47xblgkk2a
« Previous Showing results 1 — 15 out of 3,260 results