Timely crawling of high-quality ephemeral new content

Nowadays, more and more people use the Web as their primary source of up-to-date information. In this context, fast crawling and indexing of newly created Web pages has become crucial for search engines, especially because user traffic to a significant fraction of these new pages (like news, blog an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lefortier, Damien, Ostroumova, Liudmila, Samosvat, Egor, Serdyukov, Pavel
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Lefortier, Damien
Ostroumova, Liudmila
Samosvat, Egor
Serdyukov, Pavel
description Nowadays, more and more people use the Web as their primary source of up-to-date information. In this context, fast crawling and indexing of newly created Web pages has become crucial for search engines, especially because user traffic to a significant fraction of these new pages (like news, blog and forum posts) grows really quickly right after they appear, but lasts only for several days. In this paper, we study the problem of timely finding and crawling of such ephemeral new pages (in terms of user interest). Traditional crawling policies do not give any particular priority to such pages and may thus crawl them not quickly enough, and even crawl already obsolete content. We thus propose a new metric, well thought out for this task, which takes into account the decrease of user interest for ephemeral pages over time. We show that most ephemeral new pages can be found at a relatively small set of content sources and present a procedure for finding such a set. Our idea is to periodically recrawl content sources and crawl newly created pages linked from them, focusing on high-quality (in terms of user interest) content. One of the main difficulties here is to divide resources between these two activities in an efficient way. We find the adaptive balance between crawls and recrawls by maximizing the proposed metric. Further, we incorporate search engine click logs to give our crawler an insight about the current user demands. Efficiency of our approach is finally demonstrated experimentally on real-world data.
doi_str_mv 10.48550/arxiv.1307.6080
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1307_6080</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1307_6080</sourcerecordid><originalsourceid>FETCH-LOGICAL-a650-3663a5f324c1c8c1ea5772e1f26515df50f2fb325ed565c233478473be43bbc43</originalsourceid><addsrcrecordid>eNotzr1OwzAUQGEvDKiwM1V-gQTb19fOiqryI1ViyR7duNeNJSctbqDk7VGB6WxHnxAPWtW2QVSPVL7TV61B-dqpRt0KbNPIeZGh0CWn6SCPUQ7pMFQfn5TTvEg-DTxyoSwnvshwnGae5jtxEymf-f6_K9E-b9vNa7V7f3nbPO0qcqgqcA4IIxgbdGiCZkLvDetoHGrcR1TRxB4M8h4dBgNgfWM99Gyh74OFlVj_bX_Z3amkkcrSXfndlQ8_PwY_DQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Timely crawling of high-quality ephemeral new content</title><source>arXiv.org</source><creator>Lefortier, Damien ; Ostroumova, Liudmila ; Samosvat, Egor ; Serdyukov, Pavel</creator><creatorcontrib>Lefortier, Damien ; Ostroumova, Liudmila ; Samosvat, Egor ; Serdyukov, Pavel</creatorcontrib><description>Nowadays, more and more people use the Web as their primary source of up-to-date information. In this context, fast crawling and indexing of newly created Web pages has become crucial for search engines, especially because user traffic to a significant fraction of these new pages (like news, blog and forum posts) grows really quickly right after they appear, but lasts only for several days. In this paper, we study the problem of timely finding and crawling of such ephemeral new pages (in terms of user interest). Traditional crawling policies do not give any particular priority to such pages and may thus crawl them not quickly enough, and even crawl already obsolete content. We thus propose a new metric, well thought out for this task, which takes into account the decrease of user interest for ephemeral pages over time. We show that most ephemeral new pages can be found at a relatively small set of content sources and present a procedure for finding such a set. Our idea is to periodically recrawl content sources and crawl newly created pages linked from them, focusing on high-quality (in terms of user interest) content. One of the main difficulties here is to divide resources between these two activities in an efficient way. We find the adaptive balance between crawls and recrawls by maximizing the proposed metric. Further, we incorporate search engine click logs to give our crawler an insight about the current user demands. Efficiency of our approach is finally demonstrated experimentally on real-world data.</description><identifier>DOI: 10.48550/arxiv.1307.6080</identifier><language>eng</language><subject>Computer Science - Information Retrieval</subject><creationdate>2013-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1307.6080$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1307.6080$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Lefortier, Damien</creatorcontrib><creatorcontrib>Ostroumova, Liudmila</creatorcontrib><creatorcontrib>Samosvat, Egor</creatorcontrib><creatorcontrib>Serdyukov, Pavel</creatorcontrib><title>Timely crawling of high-quality ephemeral new content</title><description>Nowadays, more and more people use the Web as their primary source of up-to-date information. In this context, fast crawling and indexing of newly created Web pages has become crucial for search engines, especially because user traffic to a significant fraction of these new pages (like news, blog and forum posts) grows really quickly right after they appear, but lasts only for several days. In this paper, we study the problem of timely finding and crawling of such ephemeral new pages (in terms of user interest). Traditional crawling policies do not give any particular priority to such pages and may thus crawl them not quickly enough, and even crawl already obsolete content. We thus propose a new metric, well thought out for this task, which takes into account the decrease of user interest for ephemeral pages over time. We show that most ephemeral new pages can be found at a relatively small set of content sources and present a procedure for finding such a set. Our idea is to periodically recrawl content sources and crawl newly created pages linked from them, focusing on high-quality (in terms of user interest) content. One of the main difficulties here is to divide resources between these two activities in an efficient way. We find the adaptive balance between crawls and recrawls by maximizing the proposed metric. Further, we incorporate search engine click logs to give our crawler an insight about the current user demands. Efficiency of our approach is finally demonstrated experimentally on real-world data.</description><subject>Computer Science - Information Retrieval</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr1OwzAUQGEvDKiwM1V-gQTb19fOiqryI1ViyR7duNeNJSctbqDk7VGB6WxHnxAPWtW2QVSPVL7TV61B-dqpRt0KbNPIeZGh0CWn6SCPUQ7pMFQfn5TTvEg-DTxyoSwnvshwnGae5jtxEymf-f6_K9E-b9vNa7V7f3nbPO0qcqgqcA4IIxgbdGiCZkLvDetoHGrcR1TRxB4M8h4dBgNgfWM99Gyh74OFlVj_bX_Z3amkkcrSXfndlQ8_PwY_DQ</recordid><startdate>20130723</startdate><enddate>20130723</enddate><creator>Lefortier, Damien</creator><creator>Ostroumova, Liudmila</creator><creator>Samosvat, Egor</creator><creator>Serdyukov, Pavel</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20130723</creationdate><title>Timely crawling of high-quality ephemeral new content</title><author>Lefortier, Damien ; Ostroumova, Liudmila ; Samosvat, Egor ; Serdyukov, Pavel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a650-3663a5f324c1c8c1ea5772e1f26515df50f2fb325ed565c233478473be43bbc43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Information Retrieval</topic><toplevel>online_resources</toplevel><creatorcontrib>Lefortier, Damien</creatorcontrib><creatorcontrib>Ostroumova, Liudmila</creatorcontrib><creatorcontrib>Samosvat, Egor</creatorcontrib><creatorcontrib>Serdyukov, Pavel</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lefortier, Damien</au><au>Ostroumova, Liudmila</au><au>Samosvat, Egor</au><au>Serdyukov, Pavel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Timely crawling of high-quality ephemeral new content</atitle><date>2013-07-23</date><risdate>2013</risdate><abstract>Nowadays, more and more people use the Web as their primary source of up-to-date information. In this context, fast crawling and indexing of newly created Web pages has become crucial for search engines, especially because user traffic to a significant fraction of these new pages (like news, blog and forum posts) grows really quickly right after they appear, but lasts only for several days. In this paper, we study the problem of timely finding and crawling of such ephemeral new pages (in terms of user interest). Traditional crawling policies do not give any particular priority to such pages and may thus crawl them not quickly enough, and even crawl already obsolete content. We thus propose a new metric, well thought out for this task, which takes into account the decrease of user interest for ephemeral pages over time. We show that most ephemeral new pages can be found at a relatively small set of content sources and present a procedure for finding such a set. Our idea is to periodically recrawl content sources and crawl newly created pages linked from them, focusing on high-quality (in terms of user interest) content. One of the main difficulties here is to divide resources between these two activities in an efficient way. We find the adaptive balance between crawls and recrawls by maximizing the proposed metric. Further, we incorporate search engine click logs to give our crawler an insight about the current user demands. Efficiency of our approach is finally demonstrated experimentally on real-world data.</abstract><doi>10.48550/arxiv.1307.6080</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1307.6080
ispartof
issn
language eng
recordid cdi_arxiv_primary_1307_6080
source arXiv.org
subjects Computer Science - Information Retrieval
title Timely crawling of high-quality ephemeral new content
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T14%3A17%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Timely%20crawling%20of%20high-quality%20ephemeral%20new%20content&rft.au=Lefortier,%20Damien&rft.date=2013-07-23&rft_id=info:doi/10.48550/arxiv.1307.6080&rft_dat=%3Carxiv_GOX%3E1307_6080%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true