Low Cost Journal,International Peer Reviewed and Refereed Journals,Fast Paper Publication approved journal IJEDR(ISSN 2321-9939) apply for ugc care approved journal, UGC Approved Journal, ugc approved journal, ugc approved list of journal, ugc care journal, care journal, UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, ugc care list of journal, ugc care list 2020, ugc care approved journal, ugc care list 2020, new ugc approved journal in 2020, Low cost research journal, Online international research journal, Peer-reviewed, and Refereed Journals, scholarly journals, impact factor 7.37 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool)
(International Peer Reviewed,Refereed, Indexed, Citation Open Access Journal)
ISSN: 2321-9939 | ESTD Year: 2013

Current Issue

Call For Papers
June 2023

Volume 11 | Issue 2
Last Date : 29 June 2023
Review Results: Within 12-20 Days

For Authors


Indexing Partner

Research Area


Paper Details
Paper Title
  Janani P,  Banuchandhar J

Crewing of search engine queries has involved important concern in recent years. Many search engine appliances such as query recommendation require query crewing as a pre-requisite to job properly. Certainly, crewing is needed to unlock the true value of query logs. However, crewing search queries effectively is reasonably challenging, due to the elevated diversity and arbitrary input, processing, storage, transmission cost by users. In this crewing method, which is capable of crewing dynamic and distributed data sets. Crewing nodes continuously assist through decentralized rumor-based communication to maintain summarized views of the data set. We modify crew for execution of the partition-based and density-based crewing methods on the summarized views, and also offer enhancements to the basic algorithm. Search queries are typically tiny and confusing in terms of user requirements. Many diverse queries may refer to a single concept, while a single query may cover many concepts. Crewing gives good quality results but is computationally reasonably exclusive. We Proposed a Decentralized Crewing Frame Work for Search Engines. Coping with dynamic data is made possible by gradually adapting the crewing model. This paper presents a decentralized crewing approach using search engine results might themselves be used to discover query similarity. We propose a decentralized crew similarity metric for diverse queries based on the ranked URL results returned by a search engine for queries. This is used to develop a very efficient and accurate algorithm for crewing queries. Our experimental results demonstrate more accurate crewing performance is efficiently, better scalability and robustness, scalable transmission cost of our approach against known baselines.

Keywords- seo,storage,search engine
Publication Details
Unique Identification Number - IJEDR1702074
Page Number(s) - 430-433
Pubished in - Volume 5 | Issue 2 | April 2017
DOI (Digital Object Identifier) -   
Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  Janani P,  Banuchandhar J,   "A SURVEY ON EFFICIENT DECENTRALIZED CREWING ALGORITHM IN SEO", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.5, Issue 2, pp.430-433, April 2017, Available at :http://www.ijedr.org/papers/IJEDR1702074.pdf
Share This Article

Article Preview

ISSN Details

DOI Details

Providing A digital object identifier by DOI
How to get DOI?

For Reviewer /Referral (RMS)

Important Links

NEWS & Conference

Digital Library

Our Social Link

© Copyright 2023 IJEDR.ORG All rights reserved