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.
Searching with partial knowledge and misspelled keywords is a challenging problem in peer-to-peer networks. This paper presents FM-chord, a novel searching mechanism for information retrieval with queries containing spelling and pronunciation mistakes in keywords using a widely-used structured overlay Chord. FM-chord uses double metaphone encoding and 3-grams of keywords to reduce the effect of edit...
One of the challenges in peer-to-peer (P2P) systems is to support distributed group based resource management for increased resource availability. Replication increases resource availability, but ensuring uninterrupted 24??7 availability of resource requires intelligent replication strategy utilizing the knowledge of connectivity pattern of participating peers. In this paper we present a intelligent...
Efficient discovery of information based on partially specified and misspelled query keywords is a challenging problem in large scale peer-to-peer (P2P) networks. This paper presents QPM, a P2P search mechanism for efficient information retrieval with misspelled and partial keywords. QPM uses the double metaphone algorithm to phonetically match misspelled query keywords with advertised keywords. For...
Efficient discovery of information, based on partial knowledge, is a challenging problem faced by many large scale distributed systems. This paper presents Plexus, a peer-to-peer search protocol that provides an efficient mechanism for advertising a bit-sequence (pattern), and discovering it using any subset of its 1-bits. A pattern (e.g., Bloom filter) summarizes the properties (e.g., keywords, service...
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.