Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
