Yazar "Altingovde, Ismail Sengor" seçeneğine göre listele

Listeleniyor 1 - 6 / 6
  • Küçük Resim Yok
    Öğe
    A Financial Cost Metric for Result Caching
    (Assoc Computing Machinery, 2013) Sazoglu, Fethi Burak; Cambazoglu, B. Barla; Ozcan, Rifat; Altingovde, Ismail Sengor; Ulusoy, Ozgur
    Web search engines cache results of frequent and/or recent queries. Result caching strategies can be evaluated using different metrics, hit rate being the most well-known. Recent works take the processing overhead of queries into account when evaluating the performance of result caching strategies and propose cost-aware caching strategies. In this paper, we propose a financial cost metric that goes one step beyond and takes also the hourly electricity prices into account when computing the cost. We evaluate the most well-known static, dynamic, and hybrid result caching strategies under this new metric. Moreover, we propose a financial-cost-aware version of the well-known LRU strategy and show that it outperforms the original LRU strategy in terms of the financial cost metric.
  • Küçük Resim Yok
    Öğe
    A Suggested Picture of Web Search in Turkish
    (Assoc Computing Machinery, 2016) Sarigil, Erdem; Yilmaz, Oguz; Altingovde, Ismail Sengor; Ozcan, Rifat; Ulusoy, Ozgur
    Although query log analysis provides crucial insights about Web users' search interests, conducting such analyses is almost impossible for some languages, as large-scale and public query logs are quite scarce. In this study, we first survey the existing query collections in Turkish and discuss their limitations. Next, we adopt a novel strategy to obtain a set of Turkish queries using the query autocompletion services from the four major search engines and provide the first large-scale analysis of Web queries and their results in Turkish.
  • Küçük Resim Yok
    Öğe
    How K-12 Students Search For Learning? Analysis of an Educational Search Engine Log
    (Assoc Computing Machinery, 2014) Usta, Arif; Altingovde, Ismail Sengor; Vidinli, Ibrahim Bahattin; Ozcan, Rifat; Ulusoy, Ozgur
    In this study, we analyze an educational search engine log for shedding light on K-12 students' search behavior in a learning environment. We specially focus on query, session, user and click characteristics and compare the trends to the findings in the literature for general web search engines. Our analysis helps understanding how students search with the purpose of learning in an educational vertical, and reveals new directions to improve the search performance in the education domain.
  • Küçük Resim Yok
    Öğe
    Propagating Expiration Decisions in a Search Engine Result Cache
    (Assoc Computing Machinery, 2015) Sazoglu, Fethi Burak; Altingovde, Ismail Sengor; Ozcan, Rifat; Barla Cambazoglu, B.; Ulusoy, Ozgur
    Detecting stale queries in a search engine result cache is an important problem. In this work, we propose a mechanism that propagates the expiration decision for a query to similar queries in the cache to re-adjust their time-to-live values.
  • Küçük Resim Yok
    Öğe
    Second Chance: A Hybrid Approach for Dynamic Result Caching and Prefetching in Search Engines
    (Assoc Computing Machinery, 2013) Ozcan, Rifat; Altingovde, Ismail Sengor; Barla Cambazoglu, B.; Ulusoy, Ozgur
    Web search engines are known to cache the results of previously issued queries. The stored results typically contain the document summaries and some data that is used to construct the final search result page returned to the user. An alternative strategy is to store in the cache only the result document IDs, which take much less space, allowing results of more queries to be cached. These two strategies lead to an interesting trade-off between the hit rate and the average query response latency. In this work, in order to exploit this trade-off, we propose a hybrid result caching strategy where a dynamic result cache is split into two sections: an HTML cache and a docID cache. Moreover, using a realistic cost model, we evaluate the performance of different result prefetching strategies for the proposed hybrid cache and the baseline HTML-only cache. Finally, we propose a machine learning approach to predict singleton queries, which occur only once in the query stream. We show that when the proposed hybrid result caching strategy is coupled with the singleton query predictor, the hit rate is further improved.
  • Küçük Resim Yok
    Öğe
    Strategies for Setting Time-to-Live Values in Result Caches
    (Assoc Computing Machinery, 2013) Sazoglu, Fethi Burak; Cambazoglu, B. Barla; Ozcan, Rifat; Altingovde, Ismail Sengor; Ulusoy, Ozgur
    In web query result caching, staleness of queries are often bounded via a time-to-live (TTL) mechanism, which expires the validity of cached query results at some point in time. In this work, we evaluate the performance of three alternative TTL mechanisms: time-based TTL, frequency-based TTL, and click-based TTL. Moreover, we propose hybrid approaches obtained by pair-wise combination of these mechanisms. Our results indicate that combining time-based TTL with frequency-based TTL yields superior performance (i.e., lower stale query traffic and less redundant computation) than using a particular mechanism in isolation.