Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Hi-index | 0.00 |
In recent years, research issues associated with peer-to-peer (P2P) systems have been discussed widely To resolve the file-availability problem and improve the workload, a method called the Distributed Hash Table (DHT) has been proposed However, DHT-based systems in structured architectures cannot support efficient queries, such as a similarity query, range query, and partial-match query, due to the characteristics of the hash function This study presents a novel scheme that supports filename partial-matches in structured P2P systems The proposed approach supports complex queries and guarantees result quality Experimental results demonstrate the effectiveness of the proposed approach.