DOCSLIB.ORG

Advancement in Web Indexing Through Web Crawlers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Advancement in Web Indexing Through Web Crawlers Akarsh Gupta,etal. Journal of Engineering Research and Application www.ijera.com ISSN : 2248-9622, Vol. 10, Issue 4, ( Series -V) April 2020, pp. 39-44 RESEARCH ARTICLE OPEN ACCESS Advancement in Web Indexing through Web crawlers Akarsh Gupta, Monu Rana, Saurabh Teotia , Shivam Tyagi , Ramander Singh. Btech( IT ) 4th year MIET Meerut Btech( IT ) 4th year MIET Meerut Btech( IT ) 4th year MIET Meerut Btech( IT ) 4th year MIET Meerut Asst. Professor (IT) MIET Meerut ABSTRACT: In recent years, Internet use has increased a great deal. Users can find their resources using different links to the hypertext. This Internet use has contributed to the invention of web crawlers. Web crawlers are full-text search engines which help users navigate the web. These web crawlers can be used in additional research activities too. Information Recovery deals with searching and retrieving data inside the documents and it too looks at the online databases and web. The web crawler is characterized as a program or program which navigates the Net and downloads web records in a deliberate, computerized way. Based on the sort of information, web crawlers are more often than not isolated in three sorts of crawling strategies: Common Reason crawling, Centered crawling and Dispersed crawling. In this paper, the applicability of Web Crawler within the field of web search and an audit on Web Crawler to diverse issue spaces in web search is examined. Keywords: Web Crawler, Crawling techniques , WWW, Web Crawler Survey, Search engine.. ----------------------------------------------------------------------------------------------------------------------------- ---------- Date of Submission: 16-04-2020 Date of Acceptance: 01-05-2020 ----------------------------------------------------------------------------------------------------------------------------- ---------- I. INTRODUCTION The World Wide Web (WWW) is web client server design. It could be an effective framework based on total independence to the server for serving data accessible on the web. The data is orchestrated as a huge, conveyed, and non-linear content framework known as Hypertext Record framework. These frameworks characterize a portion of a report as being hypertext- pieces of content or pictures that are connected to other records through anchor tags. HTTP and HTML show a standard way of recovering and showing the hyperlinked reports. Internet world penetration rates by geographic Web browsers, utilize search engines to investigate regions (March 2019). the servers for required pages of data. The pages sent Starting in 1990, the World Wide Web has by the servers are handled at the client side. These developed exponentially in estimate. As of days it has ended up a vital portion of human life to nowadays, it is assessed that it contains utilize the Web to pick up data from WWW. The approximately 5.43 billion freely index-able web current populace of the world is approximately 7.8 reports [4] spread all over the world on thousands of billion as of April 2020. From .36 billion in 2000, servers. It isn't simple to look at data from such an the sum of Web clients has expanded to 4.54 billion endless collection of web archives accessible on in 2020 i.e., an increment of 1161%.from 2000 to WWW. It isn't beyond any doubt that clients will be 2020. In Asia out of 4.2 billion individuals, 2.1 able to recover information even after knowing billion (i.e.50.3 %) utilize the Web, while in India where to hunt for data by knowing its URLs as the out of 1.4 billion, .564 billion (40.86 % ) utilize the Net is ceaselessly changing. Data recovery devices Web[3]. The same development rate is anticipated are partitioned into three categories as take after: within the future too and it isn't distant absent when a) Web directories one will begin considering that life is inadequate b) Meta search engines without the Internet. c) Search engines www.ijera.com DOI: 10.9790/9622-1004053944 39 | P a g e Akarsh Gupta,etal. Journal of Engineering Research and Application www.ijera.com ISSN : 2248-9622, Vol. 10, Issue 4, ( Series -V) April 2020, pp. 39-44 II. WEB CRAWLER crawlers from the recovering portion or all of their A web crawler may be a program/software locales. Moreover, within the year 1994, or modified script that browses the World Wide Web “WebCrawler” propelled the primary “full text” in an efficient, automated manner. The structure of crawler and search engine. The “WebCrawler'' the WWW may be a graphical structure, i.e., the allowed the clients to investigate the internet joins displayed in a web page may be utilized to substance of reports instead of the watchwords and open other web pages. The Web may be a depictions composed by the net directors, decreasing coordinated chart where webpage as a hub and the possibility of confounding results and permitting hyperlink as an edge, thus the search operation may superior search capabilities. Around this time, be summarized as a handle of navigating commercial search engines started to seem with and coordinated charts. By taking after the connected being propelled from 1994 to 1997. Too presented in structure of the Net, web crawlers may navigate a 1994 was Yahoo!, a registry of web destinations that few unused web pages beginning from a webpage. A were physically kept up, in spite of the fact that web crawler moves from page to page by the afterward consolidating search engines. Amid these utilization of the graphical structure of the net pages. early long hours Yahoo! and Altavista kept up the Such programs are moreover known as robots, biggest showcase share. In 1998 Google was spiders, and worms. Web crawlers are outlined to propelled, rapidly capturing the advertisement. Not recover Web pages and embed them into nearby at all like numerous of the search engines at the repositories. Crawlers are essentially utilized to form time, Google had a straightforward uncluttered a reproduction of all the gone pages that are interface, the impartial look comes about that were afterward handled by search engines that will file the sensibly significant, and a lower number of spam downloaded pages that offer assistance in fast comes about. These final two qualities were due to searches. Search engine's work is to store info. The Google’s utilization of the PageRank algorithm and search engine's work is to store data on almost a few the utilization of anchor term weighting. Whereas web pages, which they recover from WWW. These early crawlers managed with moderately little sums pages are recovered by a Web crawler that's a of information, advanced crawlers, such as the one robotized Web browser that takes after each link it used by Google, have to handle a significantly sees. bigger volume of information due to the emotional upgrade within the sum of the Web. 2.1 The History of Web Crawler The primary Web “search engine”, a device 2.2 Working of Web Crawler called “Archie” - abbreviated from “Archives”, was The working of Web crawler is starting created in 1990 and downloaded the catalog postings with an starting set of URLs known as seed URLs. from indicated open mysterious FTP (File Transfer The download web pages for the seed URLs and Protocol) locales into nearby files, around once a extricate unused links present within the downloaded month. In 1991, “Gopher” was made, which pages. The recovered web pages are put away and recorded plain content documents. “Jughead” and well indexed on the capacity area so that by the “Veronica” programs are supportive to investigate assistance of these lists they can afterward be the said Gopher files [5], [6]. With the presentation recovered as and when required. The extricated of the World Wide Web in 1991 various of these URLs from the downloaded page are affirmed to Gopher destinations changed to web locales that know whether their related reports have as of now were appropriately connected by HTML joins [7], been downloaded or not. In case they are not [8], [9], [10]. In 1993, the “World Wide Web downloaded, the URLs are once more allowed to Wanderer” was shaped as the primary crawler . In web crawlers for encouraging downloading. This spite of the fact that this crawler was initially process is repeated until no more URLs are lost for utilized to degree the measure of the Internet, it was downloading. Millions of pages are downloaded per afterward used to recover URLs that were at that day by a crawler to total the target. point put away in a database called Wandex, the primary web search engine[14]. Another early search engine, “Aliweb'' (Archie-Like Ordering for the Internet)[15] permitted clients to yield the URL of a physically built list of their location. The list contained a list of URLs and a list of clients who composed keywords and depictions. The network overhead of crawlers at first caused much contention, but this issue was settled in 1994 with the presentation of the Robots Exclusion Standard which permitted web location directors to block www.ijera.com DOI: 10.9790/9622-1004053944 40 | P a g e Akarsh Gupta,etal. Journal of Engineering Research and Application www.ijera.com ISSN : 2248-9622, Vol. 10, Issue 4, ( Series -V) April 2020, pp. 39-44 savings in hardware and network resources. Initialize Get a URL Download Page Extricate URLs WWW Web repository.[16] C. Distributed Crawling In distributed crawling, numerous processes are utilized to crawl and download pages from the Net. IV. LITERATURE SURVEY Conceivably the biggest level study of Web page alter was performed by Fetterly et al. They crawled 151 million pages once a week for 11 weeks, and compared the adjustment over pages. Like Ntoulas et. al., they found a moderately little amount of altering, with 65% of all page sets remaining precisely the same.
Load more

Recommended publications
  • Why We Need an Independent Index of the Web ¬ Dirk Lewandowski 50 Society of the Query Reader
    Politics of Search Engines 49 René König and Miriam Rasch (eds), Society of the Query Reader: Reections on Web Search, Amsterdam: Institute of Network Cultures, 2014. ISBN: 978-90-818575-8-1. Why We Need an Independent Index of the Web ¬ Dirk Lewandowski 50 Society of the Query Reader Why We Need an Independent Index of the Web ¬ Dirk Lewandowski Search engine indexes function as a ‘local copy of the web’1, forming the foundation of every search engine. Search engines need to look for new documents constantly, detect changes made to existing documents, and remove documents from the index when they are no longer available on the web. When one considers that the web com- prises many billions of documents that are constantly changing, the challenge search engines face becomes clear. It is impossible to maintain a perfectly complete and current index.2 The pool of data changes thousands of times each second. No search engine can keep up with this rapid pace of change.3 The ‘local copy of the web’ can thus be viewed as the Holy Grail of web indexing at best – in practice, different search engines will always attain a varied degree of success in pursuing this goal.4 Search engines do not merely capture the text of the documents they find (as is of- ten falsely assumed). They also generate complex replicas of the documents. These representations include, for instance, information on the popularity of the document (measured by the number of times it is accessed or how many links to the document exist on the web), information extracted from the documents (for example the name of the author or the date the document was created), and an alternative text-based 1.
    [Show full text]
  • Building a Scalable Index and a Web Search Engine for Music on the Internet Using Open Source Software
    Department of Information Science and Technology Building a Scalable Index and a Web Search Engine for Music on the Internet using Open Source software André Parreira Ricardo Thesis submitted in partial fulfillment of the requirements for the degree of Master in Computer Science and Business Management Advisor: Professor Carlos Serrão, Assistant Professor, ISCTE-IUL September, 2010 Acknowledgments I should say that I feel grateful for doing a thesis linked to music, an art which I love and esteem so much. Therefore, I would like to take a moment to thank all the persons who made my accomplishment possible and hence this is also part of their deed too. To my family, first for having instigated in me the curiosity to read, to know, to think and go further. And secondly for allowing me to continue my studies, providing the environment and the financial means to make it possible. To my classmate André Guerreiro, I would like to thank the invaluable brainstorming, the patience and the help through our college years. To my friend Isabel Silva, who gave me a precious help in the final revision of this document. Everyone in ADETTI-IUL for the time and the attention they gave me. Especially the people over Caixa Mágica, because I truly value the expertise transmitted, which was useful to my thesis and I am sure will also help me during my professional course. To my teacher and MSc. advisor, Professor Carlos Serrão, for embracing my will to master in this area and for being always available to help me when I needed some advice.
    [Show full text]
  • Open Search Environments: the Free Alternative to Commercial Search Services
    Open Search Environments: The Free Alternative to Commercial Search Services. Adrian O’Riordan ABSTRACT Open search systems present a free and less restricted alternative to commercial search services. This paper explores the space of open search technology, looking in particular at lightweight search protocols and the issue of interoperability. A description of current protocols and formats for engineering open search applications is presented. The suitability of these technologies and issues around their adoption and operation are discussed. This open search approach is especially useful in applications involving the harvesting of resources and information integration. Principal among the technological solutions are OpenSearch, SRU, and OAI-PMH. OpenSearch and SRU realize a federated model to enable content providers and search clients communicate. Applications that use OpenSearch and SRU are presented. Connections are made with other pertinent technologies such as open-source search software and linking and syndication protocols. The deployment of these freely licensed open standards in web and digital library applications is now a genuine alternative to commercial and proprietary systems. INTRODUCTION Web search has become a prominent part of the Internet experience for millions of users. Companies such as Google and Microsoft offer comprehensive search services to users free with advertisements and sponsored links, the only reminder that these are commercial enterprises. Businesses and developers on the other hand are restricted in how they can use these search services to add search capabilities to their own websites or for developing applications with a search feature. The closed nature of the leading web search technology places barriers in the way of developers who want to incorporate search functionality into applications.
    [Show full text]
  • Efficient Focused Web Crawling Approach for Search Engine
    Ayar Pranav et al, International Journal of Computer Science and Mobile Computing, Vol.4 Issue.5, May- 2015, pg. 545-551 Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 4, Issue. 5, May 2015, pg.545 – 551 RESEARCH ARTICLE Efficient Focused Web Crawling Approach for Search Engine 1 2 Ayar Pranav , Sandip Chauhan Computer & Science Engineering, Kalol Institute of Technology and Research Canter, Kalol, Gujarat, India 1 [email protected]; 2 [email protected] Abstract— a focused crawler traverses the web, selecting out relevant pages to a predefined topic and neglecting those out of concern. Collecting domain specific documents using focused crawlers has been considered one of most important strategies to find relevant information. While surfing the internet, it is difficult to deal with irrelevant pages and to predict which links lead to quality pages. However most focused crawler use local search algorithm to traverse the web space, but they could easily trapped within limited a sub graph of the web that surrounds the starting URLs also there is problem related to relevant pages that are miss when no links from the starting URLs. There is some relevant pages are miss. To address this problem we design a focused crawler where calculating the frequency of the topic keyword also calculate the synonyms and sub synonyms of the keyword. The weight table is constructed according to the user query. To check the similarity of web pages with respect to topic keywords and priority of extracted link is calculated.
    [Show full text]
  • Distributed Indexing/Searching Workshop Agenda, Attendee List, and Position Papers
    Distributed Indexing/Searching Workshop Agenda, Attendee List, and Position Papers Held May 28-19, 1996 in Cambridge, Massachusetts Sponsored by the World Wide Web Consortium Workshop co-chairs: Michael Schwartz, @Home Network Mic Bowman, Transarc Corp. This workshop brings together a cross-section of people concerned with distributed indexing and searching, to explore areas of common concern where standards might be defined. The Call For Participation1 suggested particular focus on repository interfaces that support efficient and powerful distributed indexing and searching. There was a great deal of interest in this workshop. Because of our desire to limit attendance to a workable size group while maximizing breadth of attendee backgrounds, we limited attendance to one person per position paper, and furthermore we limited attendance to one person per institution. In some cases, attendees submitted multiple position papers, with the intention of discussing each of their projects or ideas that were relevant to the workshop. We had not anticipated this interpretation of the Call For Participation; our intention was to use the position papers to select participants, not to provide a forum for enumerating ideas and projects. As a compromise, we decided to choose among the submitted papers and allow multiple position papers per person and per institution, but to restrict attendance as noted above. Hence, in the paper list below there are some cases where one author or institution has multiple position papers. 1 http://www.w3.org/pub/WWW/Search/960528/cfp.html 1 Agenda The Distributed Indexing/Searching Workshop will span two days. The first day's goal is to identify areas for potential standardization through several directed discussion sessions.
    [Show full text]
  • Natural Language Processing Technique for Information Extraction and Analysis
    International Journal of Research Studies in Computer Science and Engineering (IJRSCSE) Volume 2, Issue 8, August 2015, PP 32-40 ISSN 2349-4840 (Print) & ISSN 2349-4859 (Online) www.arcjournals.org Natural Language Processing Technique for Information Extraction and Analysis T. Sri Sravya1, T. Sudha2, M. Soumya Harika3 1 M.Tech (C.S.E) Sri Padmavati Mahila Visvavidyalayam (Women’s University), School of Engineering and Technology, Tirupati. [email protected] 2 Head (I/C) of C.S.E & IT Sri Padmavati Mahila Visvavidyalayam (Women’s University), School of Engineering and Technology, Tirupati. [email protected] 3 M. Tech C.S.E, Assistant Professor, Sri Padmavati Mahila Visvavidyalayam (Women’s University), School of Engineering and Technology, Tirupati. [email protected] Abstract: In the current internet era, there are a large number of systems and sensors which generate data continuously and inform users about their status and the status of devices and surroundings they monitor. Examples include web cameras at traffic intersections, key government installations etc., seismic activity measurement sensors, tsunami early warning systems and many others. A Natural Language Processing based activity, the current project is aimed at extracting entities from data collected from various sources such as social media, internet news articles and other websites and integrating this data into contextual information, providing visualization of this data on a map and further performing co-reference analysis to establish linkage amongst the entities. Keywords: Apache Nutch, Solr, crawling, indexing 1. INTRODUCTION In today’s harsh global business arena, the pace of events has increased rapidly, with technological innovations occurring at ever-increasing speed and considerably shorter life cycles.
    [Show full text]
  • Web-Page Indexing Based on the Prioritize Ontology Terms
    Web-page Indexing based on the Prioritize Ontology Terms Sukanta Sinha1, 4, Rana Dattagupta2, Debajyoti Mukhopadhyay3, 4 1Tata Consultancy Services Ltd., Victoria Park Building, Salt Lake, Kolkata 700091, India [email protected] 2Computer Science Dept., Jadavpur University, Kolkata 700032, India [email protected] 3Information Technology Dept., Maharashtra Institute of Technology, Pune 411038, India [email protected] 4WIDiCoReL Research Lab, Green Tower, C-9/1, Golf Green, Kolkata 700095, India Abstract. In this world, globalization has become a basic and most popular human trend. To globalize information, people are going to publish the docu- ments in the internet. As a result, information volume of internet has become huge. To handle that huge volume of information, Web searcher uses search engines. The Web-page indexing mechanism of a search engine plays a big role to retrieve Web search results in a faster way from the huge volume of Web re- sources. Web researchers have introduced various types of Web-page indexing mechanism to retrieve Web-pages from Web-page repository. In this paper, we have illustrated a new approach of design and development of Web-page index- ing. The proposed Web-page indexing mechanism has applied on domain spe- cific Web-pages and we have identified the Web-page domain based on an On- tology. In our approach, first we prioritize the Ontology terms that exist in the Web-page content then apply our own indexing mechanism to index that Web- page. The main advantage of storing an index is to optimize the speed and per- formance while finding relevant documents from the domain specific search engine storage area for a user given search query.
    [Show full text]
  • An Ontology-Based Web Crawling Approach for the Retrieval of Materials in the Educational Domain
    An Ontology-based Web Crawling Approach for the Retrieval of Materials in the Educational Domain Mohammed Ibrahim1 a and Yanyan Yang2 b 1School of Engineering, University of Portsmouth, Anglesea Road, PO1 3DJ, Portsmouth, United Kingdom 2School of Computing, University of Portsmouth, Anglesea Road, PO1 3DJ, Portsmouth, United Kingdom Keywords: Web Crawling, Ontology, Education Domain. Abstract: As the web continues to be a huge source of information for various domains, the information available is rapidly increasing. Most of this information is stored in unstructured databases and therefore searching for relevant information becomes a complex task and the search for pertinent information within a specific domain is time-consuming and, in all probability, results in irrelevant information being retrieved. Crawling and downloading pages that are related to the user’s enquiries alone is a tedious activity. In particular, crawlers focus on converting unstructured data and sorting this into a structured database. In this paper, among others kind of crawling, we focus on those techniques that extract the content of a web page based on the relations of ontology concepts. Ontology is a promising technique by which to access and crawl only related data within specific web pages or a domain. The methodology proposed is a Web Crawler approach based on Ontology (WCO) which defines several relevance computation strategies with increased efficiency thereby reducing the number of extracted items in addition to the crawling time. It seeks to select and search out web pages in the education domain that matches the user’s requirements. In WCO, data is structured based on the hierarchical relationship, the concepts which are adapted in the ontology domain.
    [Show full text]
  • A Hadoop Based Platform for Natural Language Processing of Web Pages and Documents
    Journal of Visual Languages and Computing 31 (2015) 130–138 Contents lists available at ScienceDirect Journal of Visual Languages and Computing journal homepage: www.elsevier.com/locate/jvlc A hadoop based platform for natural language processing of web pages and documents Paolo Nesi n,1, Gianni Pantaleo 1, Gianmarco Sanesi 1 Distributed Systems and Internet Technology Lab, DISIT Lab, Department of Information Engineering (DINFO), University of Florence, Firenze, Italy article info abstract Available online 30 October 2015 The rapid and extensive pervasion of information through the web has enhanced the Keywords: diffusion of a huge amount of unstructured natural language textual resources. A great Natural language processing interest has arisen in the last decade for discovering, accessing and sharing such a vast Hadoop source of knowledge. For this reason, processing very large data volumes in a reasonable Part-of-speech tagging time frame is becoming a major challenge and a crucial requirement for many commercial Text parsing and research fields. Distributed systems, computer clusters and parallel computing Web crawling paradigms have been increasingly applied in the recent years, since they introduced Big Data Mining significant improvements for computing performance in data-intensive contexts, such as Parallel computing Big Data mining and analysis. Natural Language Processing, and particularly the tasks of Distributed systems text annotation and key feature extraction, is an application area with high computational requirements; therefore, these tasks can significantly benefit of parallel architectures. This paper presents a distributed framework for crawling web documents and running Natural Language Processing tasks in a parallel fashion. The system is based on the Apache Hadoop ecosystem and its parallel programming paradigm, called MapReduce.
    [Show full text]
  • Curlcrawler:A Framework of Curlcrawler and Cached Database for Crawling the Web with Thumb
    Ela Kumaret al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (4) , 2011, 1700-1705 CurlCrawler:A framework of CurlCrawler and Cached Database for crawling the web with thumb. Dr Ela Kumar#,Ashok Kumar$ # School of Information and Communication Technology, Gautam Buddha University, Greater Noida $ AIM & ACT.Banasthali University,Banasthali(Rajasthan.) Abstract-WWW is a vast source of information and search engines about basic modules of search engine functioning and these are the meshwork to navigate the web for several purposes. It is essential modules are (see Fig.1)[9,10]. problematic to identify and ping with graphical frame of mind for the desired information amongst the large set of web pages resulted by the search engine. With further increase in the size of the Internet, the problem grows exponentially. This paper is an endeavor to develop and implement an efficient framework with multi search agents to make search engines inapt to chaffing using curl features of the programming, called CurlCrawler. This work is an implementation experience for use of graphical perception to upright search on the web. Main features of this framework are curl programming, personalization of information, caching and graphical perception. Keywords and Phrases-Indexing Agent, Filtering Agent, Interacting Agent, Seolinktool, Thumb, Whois, CachedDatabase, IECapture, Searchcon, Main_spider, apnasearchdb. 1. INTRODUCTION Information is a vital role playing versatile thing from availability at church level to web through trends of books. WWW is now the prominent and up-to-date huge repository of information available to everyone, everywhere and every time. Moreover information on web is navigated using search Fig.1: Components of Information Retrieval System engines like AltaVista, WebCrawler, Hot Boat etc[1].Amount of information on the web is growing at very fast and owing to this search engine’s optimized functioning is always a thrust Store: It stores the crawled pages.
    [Show full text]
  • Meta Search Engine with an Intelligent Interface for Information Retrieval on Multiple Domains
    International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.1, No.4, October 2011 META SEARCH ENGINE WITH AN INTELLIGENT INTERFACE FOR INFORMATION RETRIEVAL ON MULTIPLE DOMAINS D.Minnie1, S.Srinivasan2 1Department of Computer Science, Madras Christian College, Chennai, India [email protected] 2Department of Computer Science and Engineering, Anna University of Technology Madurai, Madurai, India [email protected] ABSTRACT This paper analyses the features of Web Search Engines, Vertical Search Engines, Meta Search Engines, and proposes a Meta Search Engine for searching and retrieving documents on Multiple Domains in the World Wide Web (WWW). A web search engine searches for information in WWW. A Vertical Search provides the user with results for queries on that domain. Meta Search Engines send the user’s search queries to various search engines and combine the search results. This paper introduces intelligent user interfaces for selecting domain, category and search engines for the proposed Multi-Domain Meta Search Engine. An intelligent User Interface is also designed to get the user query and to send it to appropriate search engines. Few algorithms are designed to combine results from various search engines and also to display the results. KEYWORDS Information Retrieval, Web Search Engine, Vertical Search Engine, Meta Search Engine. 1. INTRODUCTION AND RELATED WORK WWW is a huge repository of information. The complexity of accessing the web data has increased tremendously over the years. There is a need for efficient searching techniques to extract appropriate information from the web, as the users require correct and complex information from the web. A Web Search Engine is a search engine designed to search WWW for information about given search query and returns links to various documents in which the search query’s key words are found.
    [Show full text]
  • Google Bing Facebook Findopen Foursquare
    The Network Google Active Monthly Users: 1B+ Today's world of smartphones, mobile moments, and self-driving cars demands accurate location data more than ever. And no single search, maps, and apps provider is more important to your location marketing strategy than Google. With the Yext Location Manager, you can manage your location data on Google My Business—the tool through which Businesses can supply data to Google Search, Google Maps, and Google+. Bing Active Monthly Users: 150M+ With more than 20% of search market share in the US and rapidly increasing traction worldwide, Bing is an essential piece of the local ecosystem. More than 150 million users search for local Businesses and services on Bing every month. Beginning in 2016, Bing will also power search results across the AOL portfolio of sites, including Huffington Post, Engadget, and TechCrunch. Facebook Active Monthly Users: 1.35B Facebook is the world’s Biggest social network with more than 2 Billion users. Yext Sync for FaceBook makes it easy to manage accurate and up-to-date contact information, photos, messages and more. FindOpen FindOpen is one of the world’s leading online Business directories and helps consumers find the critical information they need to know aBout the Businesses they’d like to visit, like hours of operation, holiday hours, special hours, menus, product and service lists, and more. FindOpen — also known as FindeOffen, TrovaAperto, TrouverOuvert, VindOpen, nyitva.hu, EncuentreAbierto, AussieHours, FindAaben, TeraZOtwarte, HittaӦppna, and deschis.ro in the many countries it operates — provides a fully responsive experience, no matter where its gloBal users are searching from.
    [Show full text]