Filters








8,162 Hits in 3.0 sec

Robust Data Exchange for Unreliable P2P Networks

Duc Minh Le, Andrew Smith, Peter McBrien
2008 2008 19th International Conference on Database and Expert Systems Applications  
Secondly, we provide a query processing component with a cache-driven query processor that allows peers on the network to cache queries and their results on demand.  ...  The data caches are used to give partial or complete answers to a query if the original data sources are unavailable.  ...  Query Processing The main objective of the query processing component of our system is to robustly process queries over a P2P network.  ... 
doi:10.1109/dexa.2008.83 dblp:conf/dexaw/LeSM08 fatcat:kxrynyzmu5gjdnsn43uqnwgvvy

Linking identical neighborly partitions for efficient high-dimensional similarity search in unstructured peer-to-peer systems

Bin Cui, Linhao Xu, Jiakui Zhao
2009 Distributed and parallel databases  
With the aid of LINP, each peer can not only process similarity query efficiently over its local data, but also can route the query to the promising peers which may contain the desired data.  ...  However, existing unstructured P2P systems lack support for content-based search over data objects which are generally represented by high-dimensional feature vectors.  ...  Structured P2P systems simplify query processing by tightly controlling data placement and network overlay.  ... 
doi:10.1007/s10619-009-7053-8 fatcat:tnrywtpwmbgkjbxzhc4v6us6py

Guest editorial: special issue on data management in peer-to-peer systems

Beng Chin Ooi, Kian-Lee Tan
2009 Distributed and parallel databases  
The first paper Efficient Range Query Processing in Metric Spaces over Highly Distributed Data  ...  Over the years, we have witnessed a large number of domain specific P2P systems being utilized.  ...  presents a framework SIMPEER to address the problem of efficient processing of range queries in metric spaces in a super-peer based P2P network.  ... 
doi:10.1007/s10619-009-7056-5 fatcat:dyg7xslb2bgsxdld6wwqqcwtae

Tree vector indexes: efficient range queries for dynamic content on peer-to-peer networks

M. Marzolla, M. Mordacchini, S. Orlando
2006 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)  
Most of the research in this area only considers static content, that is, it is often assumed that data in P2P systems do not vary over time.  ...  Data location exploits a distributed index based on bit vectors: this index is used to route queries towards areas of the system where matches can be found.  ...  Conclusions In this paper we described a P2P system which supports range queries over dynamic content. Data location is implemented using a distributed data structure based on bit vectors.  ... 
doi:10.1109/pdp.2006.68 dblp:conf/pdp/MarzollaO06 fatcat:45i2mybse5hdnmsh3gjhpcf5ba

A framework for the massive knowledge Web

Xiaoping Sun, Hai Zhuge, Qing Li
2009 Concurrency and Computation  
The architecture incorporates a virtual P2P overlay into the server side platform to support efficient knowledge management, semantics-rich and personalized query processing for huge amounts of dynamic  ...  Three major components are discussed herein: (1) semantic data model for massive Web2.0 content, (2) semantics-rich query model, and (3) scalable distributed semantic indexing model.  ...  To support efficient and scalable query processing, a semantic index is built over the semantic overlay based on the hierarchical clusters of the published semantic objects.  ... 
doi:10.1002/cpe.1372 fatcat:sqz3cb4lujdejjvu4eefr3micu

A semantic layer for publishing and localizing xml data for a p2p xquery mediator

Florin Dragan, Georges Gardarin, Laurent Yeh
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  
A major challenge in the evaluation of XQuery over a P2P network in the context of multiple XML sources is to abstract from structural heterogeneity.  ...  Complex query algorithms are required to exploit these semantic links between peers. In contrast, our approach focuses on a simple semantic layer.  ...  The process of query transformation based on a semantic graph is similar to the process of source annotation. We represent a semantic query as a bipartite graph.  ... 
doi:10.1145/1367497.1367678 dblp:conf/www/DraganGY08 fatcat:422oskgwu5ba5ckfxx6xh6r2dy

Design of Integrated Routing System for Mobile Ad Hoc Networks Overlaying Peer-to-Peer Applications [chapter]

Yan Annie Ding, David Everitt
2005 Lecture Notes in Computer Science  
Significantly, the system investigates a mechanism to integrate key lookup in the application layer with routing in the link layer.  ...  The routing method provides a general-purpose technique that is not limited to any specific P2P applications.  ...  However the growing demands of P2P applications in MANETs aggregate a lot of text processing and querying, which unavoidably burden the network load in MANETs.  ... 
doi:10.1007/11596042_69 fatcat:cvm2mkxagfamvoezbzmatbybou

Distributed Semantic Overlay Networks [chapter]

Christos Doulkeridis, Akrivi Vlachou, Kjetil Nørvåg, Michalis Vazirgiannis
2009 Handbook of Peer-to-Peer Networking  
Several applications, such as P2P document and image retrieval, can be deployed over generated SONs, motivating the need for distributed and truly scalable SON creation.  ...  Efficient content retrieval can be performed by having queries selectively forwarded only to relevant groups of peers to the query.  ...  The authors study query evaluation of RDF data distributed over data repositories.  ... 
doi:10.1007/978-0-387-09751-0_17 fatcat:g7tbfz33mncpnjgywn67ayx22q

Using semantic links to support top-K join queries in peer-to-peer networks

Jie Liu, Liang Feng, Hai Zhuge
2007 Concurrency and Computation  
USING SEMANTIC LINKS TO SUPPORT TOP-K QUERIES IN P2P NETWORKS tuples and the top-K miss rate.  ...  The proposed solution is to organize peers by a semantic link network representing the semantic relationships between peers' data schemas. Queries are only routed to semantically relevant peers.  ...  CONCLUSION In this paper we have proposed a semantic-link-based infrastructure for efficiently processing top-K join queries in P2P networks.  ... 
doi:10.1002/cpe.1145 fatcat:c2vnwnrjlban7fq3vfi6uhgcz4

Measuring the validity of peer-to-peer data for information retrieval applications

Noam Koenigstein, Yuval Shavitt, Ela Weinsberg, Udi Weinsberg
2012 Computer Networks  
We identify and measure inherent difficulties in collecting p2p data, namely, partial crawling, user-generated noise, sparseness, and popularity and localization of content and search queries.  ...  These aspects are quantified using music files shared in the Gnutella p2p network.  ...  This indicates that p2p data must be carefully processed to reduce the sparseness.  ... 
doi:10.1016/j.comnet.2011.10.026 fatcat:auvuzsuwyzcghnpgfyw2zqgw4e

Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks [chapter]

Peter Triantafillou, Theoni Pitoura
2004 Lecture Notes in Computer Science  
In this work we study how to process complex queries in DHT-based Peer-to-Peer (P2P) data networks. Queries are made over tuples and relations and are expressed in a query language, such as SQL.  ...  We describe existing research approaches for query processing in P2P systems, we suggest improvements and enhancements, and propose a unifying framework that consists of a modified DHT architecture, data  ...  Supporting Range Queries Gupta et. al [9] propose an architecture for relational data shared in a P2P system based on Chord, and a hashing-based method to provide approximate answers to range queries  ... 
doi:10.1007/978-3-540-24629-9_13 fatcat:zichaif3lzfsrirnehgyrkg4di

P2P Spatial Query Processing by Delaunay Triangulation [chapter]

Hye-Young Kang, Bog-Ja Lim, Ki-Joune Li
2005 Lecture Notes in Computer Science  
We compare two spatial query processing methods based on the triangular network by experiments.  ...  Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has been paid on spatial query process.  ...  However none of these methods except [11] and [12] are capable of processing spatial query in P2P environment, where spatial data are spread over nodes.  ... 
doi:10.1007/11427865_11 fatcat:vu7mpvnngrafxaz5uxbdvc5jd4

A schema-based P2P network to enable publish-subscribe for multimedia content in open hypermedia systems

Thanassis Tiropanis, Dimitris Kanellopoulos
2008 International Journal of Web Engineering and Technology  
Semantic query-based subscriptions over this P2P network can enable access to up-to-date content, while caching at certain peers enables prompt delivery of multimedia content.  ...  This paper proposes an architecture that enables the operation of OHS over a P2P overlay network of OHS servers based on semantic annotation of (a) peer OHS servers and of (b) multimedia resources that  ...  Schema-based P2P systems are the next step in distributed P2P networks with advanced data management and storage features.  ... 
doi:10.1504/ijwet.2008.016103 fatcat:s6lq32ecmjebzkdg2jbffvo3fe

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.  ...  Peer-to-Peer (P2P) applications have been widely used in last years. A P2P application is usually used for sharing Music, Movies, Games, and other files.  ...  Then the user can formulate its query based on its DTD data source. V. CONCLUSION P2P networks open a new channel for efficient downloading and sharing of files and data.  ... 
doi:10.18178/ijiet.2017.7.5.901 fatcat:stp2pkqfxfb4jd23cbj6i5abtu

Towards a Lightweight Framework for Privacy Preserving P2P XML Databases

Angela Bonifati, Alfredo Cuzzocrea
2006 2006 10th International Database Engineering and Applications Symposium (IDEAS'06)  
XPath-based identifiers, and (ii) the creation of trusted groups of peers by means of "self-certifying" XPath links that exploit the benefits of well-known fingerprinting techniques.  ...  It becomes even more challenging when XML data are managed and delivered according to the P2P paradigm, as malicious attacks could take advantage from the totally-decentralized and untrusted nature of  ...  In turn, when he/she needs static data, i.e. data with low variability over time, he/she is also offered to access his/her neighbor fragments via the above-mentioned links.  ... 
doi:10.1109/ideas.2006.43 dblp:conf/ideas/BonifatiC06 fatcat:cvzl6j2pv5a43olqv4eymtj7ae
« Previous Showing results 1 — 15 out of 8,162 results