This website uses cookies to ensure you have the best experience. Learn more

Enhancing Similarity Based Query Searching Performance Using Self Organized Semantic Overlay Networks

1103 words - 5 pages

4.1.5 Similarity based Searching

Consider a peer1 generates the query request for an object O and then peer5 hosting objects O. Instead of blindly flooding query messages in the typical Gnutella protocol, the search protocol conceptually operates as follows. Among the neighboring peers in Ipeer2, peer1 selects the peer2 which have high similarity value than peer3 (peer2,Q) > (peer3,Q).Upon receiving query Q, peer 3 performs similarly by selecting its neighbors who are more similar to peer5 than peer3 hoping that there is at least one overlay path P toward the destination pee 5, such that any two neighboring peers Peer4 and peer5 on P (peer5 receives Q sent from peer3 ) have(peer5, Query) > (peer4,Query).Clearly, the path P intends to explore progressively the peers that are likely to resolve the query Q.



Fig. 2 Similarity Computation

V. PROPOSED SYSTEM

This project proposes a novel decentralized overlay construction algorithm provides rigorous performance guarantees to enhance the efficiency and effectiveness of searches in unstructured P2P networks. In unstructured P2P network G = (V, E), where V is the set of participating peers, and E is the set of overlay connections linking the peers in V.
The peers in G may be interconnected randomly therefore the main aspect of this project is to restructure and optimize the unstructured p2p overlay based on following properties such as high clustering among similar peers, low diameter among the distinct peers to rapidly propagate the query message between them and overlay links must be very progressive. This approach constructs the optimized overlay in a decentralized manner by exploiting the similarity of participating peers. Therefore, it does not need centralized servers to perform query searching. In network formation algorithm, a querying peer takes hop count (where c is a small constant) to reach the destination peer by progressively and effectively exploiting the similarity of peers on the search path. Additionally, the probability of successfully discovering a requested object in this approach is approximately 100 percent. This approach exhibits file sharing pattern based on power-law property that leads to achieve rigorous performance guarantees in terms of the hop count of routing a query message and the successful query ratio. In proposed approach, network host the objects of interest and maintain no foreign indices that eliminates storage and bandwidth overheads for publishing and managing such indices.


Fig. 3 Proposed Architecture

Advantages

The main motivation of this scheme is improve the overall performance of P2P searching scheme. The main advantages of this approach are High quality results, Low search cost, Incurs less hop count...

Find Another Essay On Enhancing Similarity Based Query Searching Performance Using Self Organized Semantic Overlay Networks

Classes of Decentralized Peer-to-Peer Networks Essay

2061 words - 9 pages file, it sends the query to the neighbor with the largest number of returned results. The performance of this method improves over time as nodes gain more information about their environment. However, this algorithm has a poor performance in dynamic networks as it is not designed to adapt itself to departure of nodes and is based on exact match. Adaptive Probabilistic Search (APS) [58] is another adaptive informed search in which each node keeps a

IMAGE SEARCH USING HASH CODE Essay

1314 words - 6 pages classes, each with a set of similar images. In this work we represent images using the low level features [4]. The color and texture features of all the images Feature extraction Embed features to hash codes Image Database are embedded into hash codes, based on which we compute bitwise weights for each of the semantic concepts separately. Query-adaptive weights for each bit of hash code has an advantage, an images can be ranked on a finer-grained

Toward Effective Emotional Intelligence Simulation

590 words - 2 pages similarity of emotions. (3) Semantic graphs are semantic networks that can learn and represent relationships among emotions and actions stored in episodic memory (we conceptualized these as adding to semantic memory). (4) A perceptual mechanism assigns agents to types (or groups) with similar goals. (5) A memory modulator integrates results of episodic memory and semantic memory. We used the memory modulator to selectively “lesion” the different

Discovering User Goals to Improving Search Engine Applicability

758 words - 4 pages entities. Retrieving a set of documents that is semantically close to a given user query is the main problem in Information Retrieval (IR). Estimation of semantic similarity between words efficiently is demanding for differing natural language processing tasks such as automatic text summarization, textual entailment and Word Sense Disambiguation (WSD). In manually built general-purpose lexical ontologies such as WordNet, Semantically relevant

Deductive Databases

891 words - 4 pages Organization} The rest of this thesis is organized as follows. Chapter 2 illustrates the background knowledge that is related to this thesis work. Chapter 3 describes the implemented visual graph database system. A query benchmark in genomics domain that is used to test the performance of our graph database system are described in Chapter 4. Chapter 5 describes the query optimization experiments and discusses the findings of the experiments. A visual query language for gene feature topological relationships based on the genome browser visual metaphor is introduced in Chapter 6. Chapter 7 provides a conclusion and discusses the future work.

Search Engines

1245 words - 5 pages INTRODUCTION: KEYWORD-BASED search has been the most popular search in today’s searching world. The result of Keyword based search is better than Google .On Google search engine user or searcher did not find relevant image result. This is because of two reasons. Queries are in general short and non-specific. Different users may have different intentions for the same query Searching for apple by a farmer has a different

Personal Statement

1388 words - 6 pages goals are a career in teaching and research and I believe pursuing doctorate studies is my next step towards fulfilling that dream. Potential Extensions to Current Research: Drawbacks of using term-frequency based approach to tag query-terms are dimensionality of World Wide Web page documents, terms, and failure of handling unseen words and documents. If we can build a probabilistic model for the documents, we can handle this with the model

Recent Trends in Document Clustering with Evolutionary-Based Algorithms

2695 words - 11 pages . International Conference on. 2009. 58. Premalatha, K. and A.M. Natarajan, Genetic Algorithm for Document Clustering with Simultaneous and Ranked Mutation. Modern Applied Science, 2009. 3(2): p. 75-82. 59. Saini, M., D. Sharma, and P.K. Gupta. Enhancing information retrieval efficiency using semantic-based-combined-similarity-measure. in Image Information Processing (ICIIP), 2011 International Conference on. 2011. 60. Davies, D.L. and D.W. Bouldin, A Cluster

An Image Recognition/Retrieval System: Design And Implementation

1811 words - 8 pages returned image can be used as the basis for subsequent queries. In addition, this component allows users to utilize metadata to intelligently browse indexed images. Image Search Engine It interacts with the image index database to access stored visual features of indexed images. Upon the request of the image query interface or the image-browsing interface, this component finds matching image objects using a similarity measure based on shape and

SAT-Level Sentence-Completion Questions

1248 words - 5 pages semantic coherence by answering SAT level sentence completion questions. They build various models using backoff n-gram language model, maximum entropy class-based n-gram language model, recurrent neural net language model, latent semantic analysis and a combination of n-gram and latent semantic analysis. Some of the key observations are - 1) Latent semantic analysis has better accuracy than recurrent neural network [which is better than the n

Botnets: The Real Threat

4126 words - 17 pages can detect domain names used by well known botnets (Spybot, and Esbot etc.) and also by domain with less query times which cannot be detected by the signature based or statistical method. In [5], the authors have proposed a technique to identify computers compromised by the bot program for the classification of the C&C session from the traffic data using a machine learning algorithm support vector machine (SVM). Though, it is hard to detect

Similar Essays

Enhancing Performance And Security In Vanet Based Traffic Message Dissemination With Pragmetic Cost And Effect Control

1274 words - 6 pages to the source. • Geocast delivers a message to a geographic area. Thus by using the multicast routing method we are going to transmit the message to other vehicles. The Distance Based Gradient algorithm is used under the VAMD scheme which facilities the communication between vehicles either in the form of V2V or V2I. 3.8 SUMMARY This Chapter describes briefly about our problem description and existing methodologies. The various shortcomings of existing approaches are identified and solved using proposed System.

Stable And Self Adaptive Routing For Mobile Ad Hoc Networks Using Cross Layer Design

2857 words - 12 pages and its impact on the network performance. References [1] Awadhesh Kumar, Dr. Neeraj Tyagi, “Cross-layer self organized routing protocol for MANET”, Proc.Of CSIT, International Conference on Computer Communication and Management, Vol. 5 IACSIT Press, Singapore 2011 [2] B. Ramachandran, S. Shanmugavel, “Received Signal Strength based Cross layer Designs for Mobile Ad Hoc Networks”, IETE Technical Review, vol. 5, issue 4, 2008. [3] Bahador

Using Of Multi Wall Carbon Nanotube (Mwcnt) Based Nanofluid In The Heat Pipe To Get Better Thermal Performance

918 words - 4 pages ] investigated a mathematical model was developed for quantitatively evaluating the thermal performance of a water-based Al2O3 nanofluid heat pipe with a rectangular grooved wick. Their results show that, thin porous coating layer formed by nanoparticles suspended in nanofluids is a key effect of the heat transfer enhancement for the heat pipe using nanofluids. Also, the effects of the volume fraction and the size of nanoparticles on the thermal resistance

I/O Parameter Pattern Based Service Search

948 words - 4 pages clustering approach on varying user queries. The rest of the paper is organized as follows. In section 2 we dercribe a novel semantic similarity measure for computing similarity of service I/O parameters. Section 3 describes the procedure for clustering service parameters into semantic groups and the techniques for parameter pattern based service search. Section 4 discusses our experimental results. In Section 5 we essay the related work. We