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.
Query-by-keywords is the most popular manner to search for data in this computing age. However, most work was proposed for searching centralized relational databases. This paper investigates how keyword search is to be deployed in relational database-enabled peer-to-peer systems. Unlike centralized system, the key
(P2P) computing model has fueled the autonomous data sharing over the Internet in a more flexible fashion. Needless to say, XML data retrieval in P2P systems has become attractive to professionals in both research and industrial communities. In this paper, we propose a Bloom-Filter based keyword search framework for XML
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking. In this paper, we present a general keyword index and search scheme for structured P2P networks that avoids these
Recent research has shown that keyword search is a friendly and potentially effective way to retrieve information of interest over relational databases. Existing work has generally focused on implementing keyword search in centralized databases. This paper addresses keyword search over distributed databases. We adopts
In this paper we focus on building keyword search service over unstructured Peer-to-Peer (P2P) networks. Current state-of-the-art keyword search approaches for unstructured P2P systems are either blind or informed. Blind search methods such as flooding in Gnutella generate a large of redundant cloned messages and
The structure has been put forward of P2P systems are strictly based on the keyword matching to find the way of routing resources, so the routing mechanism will not be able to reflect the massive, distributed resources, and semantic information, thus reducing the precision of service discovery and search prospective
We present a simple yet novel technique for prefix search in P2P networks. The idea is to extract characters and their position information in a keyword to index objects. Our index scheme can achieve quite balanced loads, avoid hop-spots and single point of failure, reduce storage and maintenance costs, and offer some
and Ordinary peer. According to the model, this paper produces a novel Grid resource discovery algorithm, which adopts Keywords Mach algorithm based on Hash Table, employees TF_IDF to product resource keywords, locates and search s resource based on Consistent Hashing Chord, access lower latency and higher credibility
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.