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.
In this paper we present a scheme for searching XML documents by keywords in DHT-based structured P2P networks. Our idea is to construct an inverted index for XML documents in an DHT-based P2P network. To this end, we discuss how to decompose XML documents and store the resulting fragments in a DHT-based P2P network
This paper proposed a structured p2p model called balance-peer, introduce a method to partition the data rang without any global information on the load to. Our Balance-peer model is used to realize a partition-by-keyword indexing service based on DHT with each node in the system responsible for part of the keywords
We propose a new distributed architecture that aims to investigate and control the spread of contents in the KAD P2P network through the indexation of keywords and files. Our solution can control the DHT at a local level with a new strategy bypassing the Sybil attack protections inserted in KAD. For the targeted DHT
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
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.