Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Timestamp based Result Cache Invalidation Mechanisms for Web Search Engines
Date
2011-07-25
Author
Alici, Sadiye
Altıngövde, İsmail Sengör
Özcan, Rıfat
Cambazoglu, Berkant Barla
Ulusoy, Özgür
Metadata
Show full item record
Item Usage Stats
60
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/81397
Collections
Unclassified, Article
Suggestions
OpenMETU
Core
Timestamp-based result cache invalidation for web search engines
Alici, Sadiye; Altıngövde, İsmail Sengör; Ozcan, Rifat; Cambazoglu, B. Barla; Ulusoy, Özgür (2011-01-01)
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 evaluate...
Timestamp-based cache invalidation for search engines
Alici, Sadiye; Altıngövde, İsmail Sengör; Ozcan, Rifat; Cambazoglu, B. Barla; Ulusoy, Özgür (2011-05-02)
We propose a new mechanism to predict stale queries in the result cache of a search engine. The novelty of our approach is in the use of timestamps in staleness predictions. We show that our approach incurs very little overhead on the system while its prediction accuracy is comparable to earlier works.
Time memory trade off attack on symmetric ciphers
Saran, A. Nurdan; Doğanaksoy, Ali; Department of Cryptography (2009)
Time Memory Trade O (TMTO) is a cryptanalytic method that aims to develop an attack which has a lower memory complexity than lookup table and a lower online time complexity than exhaustive search. TMTO methods are widely studied in the literature and used for inverting various cryptosystems. We focus on the design and the analysis of TMTO on symmetric ciphers in this thesis. Firstly, the summary of the random mapping statistics from the view point of TMTO is presented. We also recalculate some expected valu...
Bootstrap and cross-validation methods in graphical lasso algorithm
Kaygusuz, Mehmet Ali; Purutçuoğlu Gazi, Vilda (2021-09-24)
Time Preference aware Dynamic Recommendation Enhanced with Location, Social Network and Temporal Information
Ozsoy, Makbule Gulcin; Polat, Faruk; Alhajj, Reda (2016-08-21)
Social networks and location based social networks have many active users who provide various kind of data, such as where they have been, who their friends are, which items they like more, when they go to a venue. Location, social network and temporal information provided by them can be used by recommendation systems to give more accurate suggestions. Also, recommendation systems can provide dynamic recommendations based on the users' preferences, such that they can give different recommendations for differ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Alici, İ. S. Altıngövde, R. Özcan, B. B. Cambazoglu, and Ö. Ulusoy, “Timestamp based Result Cache Invalidation Mechanisms for Web Search Engines,” 2011, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/81397.