Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vassiliki Hatzi

dblp:134/5390 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › search engines
web crawling
0.212016
Optimal Web Page Download Scheduling Policies for Green Web Crawling · IEEE J. Sel. Areas Commun. 2016
Energy-efficient computing
carbon-aware computing
0.112016
Optimal Web Page Download Scheduling Policies for Green Web Crawling · IEEE J. Sel. Areas Commun. 2016

Methods — techniques the papers use, named apart from their topics

simulation · 0.5greedy policy · 0.5
YearPublicationVenuePosition
2016 Optimal Web Page Download Scheduling Policies for Green Web Crawling
abstract
A web crawler is responsible for discovering and downloading new pages on the Web as well as refreshing previously downloaded pages. During these operations, the crawler issues a large number of HTTP requests to web servers. These requests increase the energy consumption and carbon footprint of the web servers since computational resources are used while serving the requests. In this work, we introduce the problem of green web crawling, where the objective is to devise a page refresh policy that minimizes the total staleness of pages in the repository of a web crawler, subject to a constraint on the amount of carbon emissions due to the processing on web servers. For the case of one web server and one crawling thread, the optimal policy turns out to be a greedy one. At each iteration, the page to be refreshed is selected based on a metric that considers the page's staleness, its size, and the greenness of the energy consumed at the web server premises. We then extend the optimal policy to the cases of 1) many servers; 2) multiple threads; and 3) pages with variable freshness requirements. We conduct simulations on a real data set that involves a large web server collection hosting around two billion pages. We present experimental results for the optimal page refresh policy as well as for various heuristics, in an effort to study the effect of different factors on performance.
Vassiliki Hatzi, Berkant Barla Cambazoglu, Iordanis Koutsopoulos
IEEE J. Sel. Areas Commun.1