Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Most educational resource grids are required to support multi-attribute multi-keyword fuzzy-matching queries. But such queries are not efficiently supported in current structured P2P systems. Towards an efficient P2P system capable of processing multi-attribute multi-keyword fuzzy-matching queries with high recall
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
features which allow attacks, especially DDoS attacks. In this paper, we proposed a new DDoS attack caused by changing source IP address in response message of source search. In the proposed attack, there are two types of attackers, which change their KadID as KeywordID for keyword search and File Hash for source search as
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...
In informal data sharing environments, misspellings cause problems for data indexing and retrieval. This is even more pronounced in mobile environments, in which devices with limited input devices are used. In a mobile environment, similarity search algorithms for finding misspelled data need to account for limited CPU and bandwidth. This demo shows P2P fast similarity search (P2PFastSS) running on...
In this paper, we propose CYBER, a CommunitY Based sEaRch engine, for information retrieval utilizing community feedback information in a DHT network. In CYBER, each user is associated with a set of user profiles that capture his/her interests. Likewise, a document is associated with a set of profiles-one for each indexed term. A document profile is updated by users who query on the term and consider...
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 novel techniques to reduce bandwidth cost in a continuous keyword query processing system that is based on a distributed hash table. We argue that query indexing and document announcement are of significant importance towards this goal. Our detailed simulations show that our proposed
There are currently two interface types for searching and browsing large image collections: keyword-based image retrieval (KBIR), and content-based image retrieval (CBIR). The KBIR system searches images according to the text of keyword annotated on images. This method is simple and relative effective to the query
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
distributed inverted index by concept for documents. Based on them, semantic search is implemented with inference technique of Description Logic between concept descriptions of documents and query. Simulation experiments show that our approach is much higher on retrieval perform than traditional method of literal keywords
Peers search contents with information of contents such as keywords in many peer-to-peer contents sharing systems. In many peer-to-peer contents search architectures, queries are forwarded to peers which belong to clusters related with the keywords. Since clusters are basically constructed regardless of physical
Full-Text Retrieval. This system could find and locate the keywords which users interested in scientifically and efficiently. Besides the function of full-text retrieval, this system also contains ID Authentication, this ensures the safety of the share resources. In the end, we prove that our system is more efficient than
Traditional text retrieval techniques greatly consume system resources. Although some file-sharing software realizes file positioning and high-speed downloads, they have no enough capacity to analysis variety format Chinese documents and to extract keywords. At the same time, during the operation of system, it exist
contents based on the related keywords. Note that the mobility and storage space of the mobile peers are exploited here to diffuse the content search requests. Moreover, to improve the efficiency under the restricted storage space conditions, a utility-based buffer management policy is presented. By evaluating each possible
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.