EDBT 2026 Demo / reviewers in the wild / expert

Emre Bakkal

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

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

Databases, data management, data science and information retrieval · 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 · 75% Query processing and optimization · 25%

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

TopicWeightPapersLastEvidence papers
Information retrieval › distributed information retrieval
metasearch		 0.212015
Cost-Aware Result Caching for Meta-Search Engines · SIGIR 2015
Information retrieval
query processing		 0.212015
Cost-Aware Result Caching for Meta-Search Engines · SIGIR 2015
Query processing and optimization
query result caching		 0.212015
Cost-Aware Result Caching for Meta-Search Engines · SIGIR 2015
Information retrieval › search engines
search engine architecture		 0.212015
Cost-Aware Result Caching for Meta-Search Engines · SIGIR 2015

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

eviction policies · 0.2
YearPublicationVenuePosition
2015 Cost-Aware Result Caching for Meta-Search Engines
abstract
Our goal in this paper is to design cost-aware result caching approaches for meta-search engines. We introduce different levels of eviction, namely, query-, resource- and entry-level, based on the granularity of the entries to be evicted from the cache when it is full. We also propose a novel entry-level caching approach that is tailored for the meta-search scenario and superior to alternative approaches.
Emre Bakkal, Ismail Sengör Altingövde, Ismail Hakki Toroslu
 SIGIR1