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.
data querying is essential. We propose a multi-keyword routing protocol, iBubble, for heterogeneous wireless sensor networks (HWSNs) where keywords describe sensor functionalities. iBubble provides an efficient query interface for locating data; queries are routed only along paths with nodes matching the query. iBubble
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
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
Peer-to-peer approaches bring one perfect alternative for the Web content search. However, how to search and retrieve the data based on the content query is still an open problem for peer-to-peer systems. In this paper we propose History-based Multi-keywords Search(HMS) in unstructured peer-to-peer systems, which only
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
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
design and prototype implementation of XSense, an architecture supporting metadata and query services for an underlying large scale dynamic P2P sensor network. We cluster sensor devices into manageable groupings to optimise the query process and automatically locate appropriate clusters based on keyword abstraction from
number of users with diverse characteristics and needs. Currently, many research projects or practical applications have emerged which only support single keyword search, and few of them support semantic retrieval. In this paper, we propose a model of ontology-based semantic information retrieval systems according to hybrid
Chord is a common circular P2P model with high routing efficiency and stable data inquiring. This paper proposes the Hot-Chord algorithm according to the fact that hot resources have occupied the majority of searching in the P2P system. Hot-Chord algorithm constructs an inner chord dynamically by using the nodes which hot resources is locating, to decrease the inquiring space; Nodes join or leave...
In structured peer-to-peer (P2P) overlay networks, similar documents are randomly distributed over peers with their data identifiers consistently hashed, which makes complex search challenging. Current state-of-the-art complex query approaches in structured P2P systems are mainly based on inverted list intersection. When the identifiers are distributed among peers, a complex query may involve many...
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...
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
by the keyword search method enabled in P2P networks; a typical P2P network uses query broadcast to enable keyword search and are not able to express impreciseness. These protocols and mechanisms can be reinforced by the use of fuzzy logic. We propose an architecture that integrates fuzzy queries and an inference
Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Precomputing term-set-based index can significantly reduce the cost but needs exponentially growing index size. Based on our observations that 1
implement an indexing infrastructure supporting range queries on top of Distributed Hash Tables. The algorithm supports hierarchical keywords, and is especially designed for situations where a few keywords are very common while others are very uncommon. The design of our algorithm perfectly matches the requirements found in 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
User-community Profiling + Domain Knowledge + CBR (including keywords/QBE) is an effective way to go forward. Experiments on a prototype of DMRD system demonstrate the feasibility and effectiveness of such a hybrid approach we are advocating.
Notice of Violation of IEEE Publication Principles"Enhanced P2P Services Providing Multimedia Content,"by E. Ardizzone, L. Gatani, M. La Cascia, G. Lo Re, M. Ortolani,in the Proceedings of the Eighth IEEE International Symposium on Multimedia, 2006. ISM 2006. pp.637-646, Dec. 2006After careful and considered review of the content and authorship of this paper by a duly constituted expert...
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.