An efficient search mechanism for supporting partial filename queries in structured peer-to-peer overlay - Springer

摘要

Accompanying the growth of the Internet, computers throughout the world can connect to each other and exchange information, increasing the convenience and efficiency of information-based work. The advent of data-sharing applications, such as Napster and Gnutella, has made peer-to-peer (P2P) systems popular for widespread exchange of resources and voluminous information between millions of users. In recent years, research issues associated with 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.