Impact of response latency on user behavior in web search

I Arapakis, X Bai, BB Cambazoglu - … of the 37th international ACM SIGIR …, 2014 - dl.acm.org
Traditionally, the efficiency and effectiveness of search systems have both been of great
interest to the information retrieval community. However, an in-depth analysis on the …

Databases in Edge and Fog Environments: A Survey

LM Meruje Ferreira, F Coelho, J Pereira - ACM Computing Surveys, 2024 - dl.acm.org
While a significant number of databases are deployed in cloud environments, pushing part
or all data storage and querying planes closer to their sources (ie, to the edge) can provide …

Duplicate bug report detection: How far are we?

T Zhang, DG Han, V Vinayakarao, IC Irsan… - ACM Transactions on …, 2023 - dl.acm.org
Many Duplicate Bug Report Detection (DBRD) techniques have been proposed in the
research literature. The industry uses some other techniques. Unfortunately, there is …

CA-DAG: Modeling communication-aware applications for scheduling in cloud computing

D Kliazovich, JE Pecero, A Tchernykh, P Bouvry… - Journal of Grid …, 2016 - Springer
This paper addresses performance issues of resource allocation in cloud computing. We
review requirements of different cloud applications and identify the need of considering …

Lowering the latency of data processing pipelines through FPGA based hardware acceleration

M Owaida, G Alonso, L Fogliarini… - … of the VLDB …, 2019 - research-collection.ethz.ch
Web search engines often involve a complex pipeline of processing stages including
computing, scoring, and ranking potential answers plus returning the sorted results. The …

Understanding within-content engagement through pattern analysis of mouse gestures

I Arapakis, M Lalmas, G Valkanas - Proceedings of the 23rd ACM …, 2014 - dl.acm.org
The availability of large volumes of interaction data and scalable data mining techniques
have made possible to study the online behaviour for millions of Web users. Part of the …

Learning to predict response times for online query scheduling

C Macdonald, N Tonellotto, I Ounis - … of the 35th international ACM SIGIR …, 2012 - dl.acm.org
Dynamic pruning strategies permit efficient retrieval by not fully scoring all postings of the
documents matching a query--without degrading the retrieval effectiveness of the top-ranked …

ANT-Man: Towards agile power management in the microservice era

X Hou, C Li, J Liu, L Zhang, Y Hu… - … Conference for High …, 2020 - ieeexplore.ieee.org
The emerging trend of decomposing cloud applications into microservices has raised new
questions about managing the performance/power trade-off of a datacenter at …

On name-based inter-domain routing

J Rajahalme, M Särelä, K Visala, J Riihijärvi - Computer Networks, 2011 - Elsevier
Locating objects with topology-independent identifiers has emerged as a key functionality in
recent content networking approaches. Numerous designs have been proposed to address …

Querying big graphs within bounded resources

W Fan, X Wang, Y Wu - Proceedings of the 2014 ACM SIGMOD …, 2014 - dl.acm.org
This paper studies the problem of querying graphs within bounded resources. Given a query
Q, a graph G and a small ratio α, it aims to answer Q in G by accessing only a fraction GQ of …