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

Hyun-Kyu Cho

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

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

Databases, data management, data science and information retrieval · 1

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 · 70% Data stream processing · 30%

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

TopicWeightPapersLastEvidence papers
Information retrieval › search engines › web crawling
refresh scheduling
0.112007
Efficient Monitoring Algorithm for Fast News Alerts · IEEE Trans. Knowl. Data Eng. 2007
Information retrieval
search engines
0.112007
Efficient Monitoring Algorithm for Fast News Alerts · IEEE Trans. Knowl. Data Eng. 2007
Information retrieval › web search › web information retrieval › social media retrieval
blog retrieval
0.012007
Efficient Monitoring Algorithm for Fast News Alerts · IEEE Trans. Knowl. Data Eng. 2007

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

scheduling · 0.1resource allocation · 0.1
YearPublicationVenuePosition
2007 Efficient Monitoring Algorithm for Fast News Alerts
abstract
Recently, there has been a dramatic increase in the use of XML data to deliver information over the Web. Personal Weblogs, news Web sites, and discussion forums are now publishing RSS feeds for their subscribers to retrieve new postings. As the popularity of personal Weblogs and RSS feeds grows rapidly, RSS aggregation services and blog search engines have appeared, which try to provide a central access point for simpler access and discovery of new content from a large number of diverse RSS sources. In this paper, we study how the RSS aggregation services should monitor the data sources to retrieve new content quickly using minimal resources and to provide its subscribers with fast news alerts. We believe that the change characteristics of RSS sources and the general user access behavior pose distinct requirements that make this task significantly different from the traditional index refresh problem for Web search engines. Our studies on a collection of 10,000 RSS feeds reveal some general characteristics of the RSS feeds and show that, with proper resource allocation and scheduling, the RSS aggregator provides news alerts significantly faster than the best existing approach.
Ka Cheung Sia, Junghoo Cho, Hyun-Kyu Cho
IEEE Trans. Knowl. Data Eng.3