Sadiye Alici

dblp:08/9377 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 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 · 35% Query processing and optimization · 22% Database system architecture and tuning · 22%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
cache invalidation
0.112011
Timestamp-based result cache invalidation for web search engines · SIGIR 2011
Indexing and storage engines
index maintenance
0.112011
Timestamp-based result cache invalidation for web search engines · SIGIR 2011
Query processing and optimization
query result caching
0.112011
Timestamp-based result cache invalidation for web search engines · SIGIR 2011
Information retrieval › search engines
search engine architecture
0.112011
Timestamp-based result cache invalidation for web search engines · SIGIR 2011
Information retrieval
query log analysis
0.012011
Timestamp-based result cache invalidation for web search engines · SIGIR 2011
Information retrieval
web search
0.012011
Timestamp-based result cache invalidation for web search engines · SIGIR 2011

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

timestamp comparison · 0.1time-to-live baseline · 0.1
YearPublicationVenuePosition
2012 Adaptive Time-to-Live Strategies for Query Result Caching in Web Search Engines
Sadiye Alici, Ismail Sengör Altingövde, Rifat Ozcan, Berkant Barla Cambazoglu, Özgür Ulusoy
ECIR1
2011 Timestamp-based result cache invalidation for web search engines
abstract
The result cache is a vital component for efficiency of large-scale web search engines, and maintaining the freshness of cached query results is the current research challenge. As a remedy to this problem, our work proposes a new mechanism to identify queries whose cached results are stale. The basic idea behind our mechanism is to maintain and compare generation time of query results with update times of posting lists and documents to decide on staleness of query results. The proposed technique is evaluated using a Wikipedia document collection with real update information and a real-life query log. We show that our technique has good prediction accuracy, relative to a baseline based on the time-to-live mechanism. Moreover, it is easy to implement and incurs less processing overhead on the system relative to a recently proposed, more sophisticated invalidation mechanism.
Sadiye Alici, Ismail Sengör Altingövde, Rifat Ozcan, Berkant Barla Cambazoglu, Özgür Ulusoy
SIGIR1