The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Structured P2P systems can locate a resource by the unique identifier of the resource using distributed hash table. So users must know the identifier of a resource exactly to retrieve the resource in such systems. In addition, because of the variety and complexity of resources, a resource can not be described exactly and integrally only with an identifier, but needs multiple properties. Using metadata...
To solve the Chord algorithm of P2P system only supporting single keyword precise query problem, we join the Hilbert curve into the Chord ring to form a new structure-HilbertChord (HC). It is a structure based on the Hilbert curve and Chord system. HC provides a good support for the approximate query. Experiments
In this paper, we propose an efficient multiple hashes method (called KAD-N) to balance peer loads in the KAD (Kademlia) network. Note that N is the maximum hash times, determining by a cost-effectiveness factor. This method hashes the keyword of an object r times to produce a key for publishing objects, where r is a
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.