1,491 Hits in 4.1 sec

Online Querying of Concept Hierarchies in P2P Systems [chapter]

Katerina Doka, Athanasia Asiki, Dimitrios Tsoumakos, Nectarios Koziris
2008 Lecture Notes in Computer Science  
In this paper we describe HIS, a system that enables efficient storage and querying of data organized into concept hierarchies and dispersed over a network.  ...  Combined with soft-state indices created after query misses, our system achieves maximization of performance by minimizing query flooding.  ...  Acknowledgments This work was partly supported by the European Commission in terms of the GREDIA FP6 IST Project (FP6-34363).  ... 
doi:10.1007/978-3-540-88871-0_16 fatcat:3otlshwpfvb6pdoilaejylo2re

OSQR: A framework for ontology-based semantic query routing in unstructured P2P networks

D M Rasanjalee Himali, Shamkant B. Navathe, Sushil K Prasad
2012 2012 19th International Conference on High Performance Computing  
An extensive set of simulations performed to evaluate the effectiveness of the system on P2P networks show 380% and 717% improvement in average recall rate, and 410% and 725% improvement in average precision  ...  In our proposed system, the queries are routed in the network by forwarding to peers with highly relevant content in their local storages.  ...  Many current P2P systems incorporate semantic web technologies in their systems with the purpose of providing better knowledge and query representations as well as efficient content discovery.  ... 
doi:10.1109/hipc.2012.6507486 dblp:conf/hipc/HimaliNP12 fatcat:hhzfh3rzorc6dkmjmwtmvoco2q

An adaptive online system for efficient processing of hierarchical data

Athanasia Asiki, Dimitrios Tsoumakos, Nectarios Koziris
2009 Proceedings of the 18th ACM international symposium on High performance distributed computing - HPDC '09  
Concept hierarchies greatly help in the organization and reuse of information and are widely used in a variety of information systems applications.  ...  In this paper, we describe a method for efficiently storing and querying data organized into concept hierarchies and dispersed over a DHT.  ...  In this paper, we present a system that efficiently stores, queries and updates data organized in concept hierarchies.  ... 
doi:10.1145/1551609.1551627 dblp:conf/hpdc/AsikiTK09 fatcat:kao5t4qc45gwllfmhnrauxlnti

Selective information dissemination in P2P networks

Manolis Koubarakis, Christos Tryfonopoulos, Stratos Idreos, Yannis Drougas
2003 SIGMOD record  
Acknowledgements We would like to acknowledge the comments of all members of project DIET on various aspects of our work.  ...  In this way, each super-peer has a profile hierarchy to organize the process of profile forwarding. Additionally, the system supports the typical ad-hoc query scenario.  ...  The main application scenario considered in recent P2P data sharing systems is that of ad-hoc querying: a user poses a query (e.g., "I want MP3s with Jennifer Lopez") and the system returns a list of pointers  ... 
doi:10.1145/945721.945736 fatcat:ca3q75yaofcpxpefard4hlyi4e

Managing Linguistic Data Summaries in Advanced P2P Applications [chapter]

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
2009 Handbook of Peer-to-Peer Networking  
As the amount of stored data increases, data localization techniques become no longer sufficient in P2P systems.  ...  The novelty of this proposal relies on the double summary exploitation in distributed P2P systems. First, as semantic indexes, they support locating relevant nodes based on their data descriptions.  ...  Obviously, data summarization is of higher importance in P2P systems.  ... 
doi:10.1007/978-0-387-09751-0_20 fatcat:fsbeo6paq5bnjlgltuze6zayfu

Special issue on information dissemination and new services in P2P systems

Min Song, Sachin Shetty, Wenbin Jiang, EK Park
2010 Peer-to-Peer Networking and Applications  
By exploiting the concepts of hierarchy and semantics, PSON has been demonstrated to support complex queries in a scalable and efficient way.  ...  ., attacks the problem of scalability, routing efficiency and complex query support for a P2P file sharing system.  ... 
doi:10.1007/s12083-010-0095-x fatcat:fg4vbytkrzf7tgosocdt3sw4y4

Optimization Research of the OLAP Query Technology Based on P2P

Chunfeng Wang
2014 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
The node in the P2P system is both client and server. In an ideal P2P system, each node can acquire the same rights and obligations, equality exchange data and provide services.  ...  Using the method of P2P network technology and OLAP storage query and query method, the paper has constructed a distributed P2P-OLAP network model and the model distributed stores the data and centralized  ...  In recent years, with the study of P2P network technology in-depth, P2P-OLAP model is more suitable for the deployment and implementation of OLAP query system.  ... 
doi:10.12928/telkomnika.v12i4.436 fatcat:d5zztg7vyfcnrkkxwlto6uf6dm

On Peer-to-Peer Multimedia Content Access and Distribution

Zhu Liu, Heather Yu, Deepa Kundur, Madjid Merabti
2006 2006 IEEE International Conference on Multimedia and Expo  
This paper provides a brief overview of recent progress of peer-to-peer (P2P) technologies for multimedia applications.  ...  We provide an overview of the technical challenges, creative solutions and results related to P2P file sharing and content search, and P2P media streaming.  ...  In partially decentralized systems (also called hybrid P2P systems in the literature), there exists a hierarchy of leaf nodes and supernodes as a tradeoff to meet the requirement of scalability and search  ... 
doi:10.1109/icme.2006.262469 dblp:conf/icmcs/LiuYKM06 fatcat:kztd7o2gcfe4lawdxhn4rzo7yu

Design of a Novel Intelligent Framework for Finding Experts and Learning Peers in Open Knowledge Communities

Pengfei Wu, Shengquan Yu
2015 EAI Endorsed Transactions on Future Intelligent Educational Environments  
However, with the rapid expanding of learning content resources and users, it is difficult for learners to find the right persons they need as knowledge experts and learning peers in OKCs using traditional  ...  After describing the architectural details of the framework, the authors elaborate on the intelligent framework design, the work principle, and mechanism of each module.  ...  This paper is therefore also supported by the Oriental Scholar Program of Shanghai Municipal Education Committee (TPKY052WMJ).  ... 
doi:10.4108/fiee.1.2.e4 fatcat:jsfr7egwzjh7nfxdf46yivia74

Agreement Maintenance Based on Schema and Ontology Change in P2P Environment [article]

L.Y. Banowosari, I.W.S. Wicaksana, A.B. Mutiara
2010 arXiv   pre-print
The contribution of this research is to develop a framework based on semantic agreement maintenance approach for P2P environment.  ...  The experiment on the job matching domain in Indonesia have been done to show how far the performance of the approach.  ...  The other approach is working in XML p2p database systems [4] . This approach presented a novel technique for detecting corrupted mappings in XML p2p data integration systems.  ... 
arXiv:1003.3082v1 fatcat:wg3zps4gmzhclgp3adxp2g7wlm

BSI: Bloom Filter-Based Semantic Indexing for Unstructured P2P Networksh

Rasanjalee Dissanayaka, Sushil K Prasad, Shamkant B. Navathe, Vikram Goyal
2015 International Journal of Peer to Peer Networks  
Most existing P2P systems rely on indexing to efficiently route queries over the network. However, searches based on such indices face two key issues.  ...  Resource management and search is very important yet challenging in large-scale distributed systems like P2Pnetworks.  ...  with state-of-art unstructured P2P systems.  ... 
doi:10.5121/ijp2p.2015.6102 fatcat:gnsjjkifnbhuve4gyid6vg4tva

CISS: An efficient object clustering framework for DHT-based peer-to-peer applications

Jinwon Lee, Hyonik Lee, Seungwoo Kang, Su Myeon Kim, Junehwa Song
2007 Computer Networks  
In most DHT-based peer-to-peer systems, objects are totally declustered since such systems use a hash function to distribute objects evenly.  ...  However, such an object de-clustering can result in significant inefficiencies in advanced access operations such as multi-dimensional range queries, continuous updates, etc, which are common in many emerging  ...  [13] proposed an online scheme to balance storage space taken by peer nodes in the context of P2P databases.  ... 
doi:10.1016/j.comnet.2006.07.005 fatcat:3bgq7utnkja7bidts6aa2halkm

A framework for distributed knowledge management: Design and implementation

Giuseppe Pirró, Carlo Mastroianni, Domenico Talia
2010 Future generations computer systems  
We present an implementation of the designed framework in the K-link+ system and show the suitability of this approach through a use case.  ...  The evaluation of K-link+ in a real network is also discussed.  ...  Current approaches to consistency management in P2P networks depend on the scale of the system.  ... 
doi:10.1016/j.future.2009.06.004 fatcat:i3h2bwm5qfa37o3z766hqo5uxm

Distributing and searching concept hierarchies: an adaptive DHT-based system

Athanasia Asiki, Dimitrios Tsoumakos, Nectarios Koziris
2010 Cluster Computing  
Concept hierarchies greatly help in the organization and reuse of information and are widely used in a variety of information systems applications.  ...  In this paper, we describe a method for efficiently storing and querying data organized into concept hierarchies and dispersed over a DHT.  ...  Acknowledgements We would like to thank the administration team of the CESGA EGEE Accounting Portal [1] , who kindly provided us real data regarding the usage of their portal.  ... 
doi:10.1007/s10586-010-0136-5 fatcat:5iqz6lak7bdk5fmjuvnmj4hoye

Peer to Peer Networks Management Survey [article]

Mourad Amad, Ahmed Meddahi, Djamil Aïssani
2012 arXiv   pre-print
Peer-to-Peer systems are based on the concept of resources localization and mutualisation in dynamic context.  ...  The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network.  ...  ABC can achieve each query within O( n n . log . log ) log( ) hops in the structured P2P system, where n is the total number of nodes in the system.  ... 
arXiv:1203.3351v1 fatcat:rn2p72niznav3ox3mtzqecze4i
« Previous Showing results 1 — 15 out of 1,491 results