Hamish Nicholson

dblp:264/5712 · DBLP profile ↗
← Back
6ranked-venue papers in the field
5as first author
6since 2021 · last 2026
0000-0003-0306-3253ORCID · corroborated

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 6 (5 first)
YearPublicationVenuePosition
2026 Data Movement-Aware GPU Sharing for Data-Intensive Systems
Hamish Nicholson, Viktor Sanca, Anastasia Ailamaki
CIDR2
2026 A-Scan: Efficient Scale-Up Analytics via Throughput-Guided Data Movement
Hamish Nicholson, Aunn Raza, Viktor Sanca, Anastasia Ailamaki
ICDE1
2025 The Effectiveness of Compression for GPU-Accelerated Queries on Out-of-Memory Datasets
abstract
DIAS
Hamish Nicholson, Konstantinos Chasialis, Antonio Boffa, Anastasia Ailamaki
DaMoN1
2024 HPCache: memory-efficient OLAP through proportional caching revisited
abstract
Analytical engines rely on in-memory data caching to avoid storage accesses and provide timely responses by keeping the most frequently accessed data in memory. Purely frequency- and time-based caching decisions, however, are a proxy of the expected query execution speedup only when storage accesses are significantly slower than in-memory query processing. On the other hand, fast storage offers loading times that approach fully in-memory query response times, rendering purely frequency-based statistics incapable of capturing the impact of a caching decision on query execution. For example, caching the input of a frequent query that spends most of its time processing joins is less beneficial than caching a page for a slightly less frequent but scan-heavy query. Thus, existing caching policies waste valuable memory space to cache input data that offer little-to-no acceleration for analytics. This paper proposes HPCache, a buffer management policy that enables fast analytics on high-bandwidth storage by efficiently using the available in-memory space. HPCache caches data based on the speedup potential instead of relying on frequency-based statistics. We show that, with fast storage, the benefit of in-memory caching varies significantly across queries; therefore, we quantify the efficiency of caching decisions and formulate an optimization problem. We implement HPCache in Proteus and show that (i) estimating speedup potential improves memory space utilization, and (ii) simple runtime statistics suffice to infer speedup. We show that HPCache achieves up to a 1.75x speed-up over frequency-based caching policies by caching column proportions and automatically tuning them. Overall, HPCache enables efficient use of the in-memory space for input caching in the presence of fast storage, without requiring workload predictions.
Hamish Nicholson, Periklis Chrysogelos, Anastasia Ailamaki
VLDB J.1
2023 HetCache: Synergising NVMe Storage and GPU acceleration for Memory-Efficient Analytics
Hamish Nicholson, Aunn Raza, Periklis Chrysogelos, Anastasia Ailamaki
CIDR1
2022 HPCache: Memory-Efficient OLAP Through Proportional Caching
abstract
Analytical engines rely on in-memory caching to avoid disk accesses and provide timely responses by keeping the most frequently accessed data in memory. Purely frequency- & time-based caching decisions, however, are a proxy of the expected query execution speedup only when disk accesses are significantly slower than in-memory query processing. On the other hand, fast storage offers loading times that approach or even outperform fully in-memory query execution response times, rendering purely frequency-based statistics incapable of capturing impact of a caching decision on query execution. For example, caching the input of a frequent query that spends most of its time processing joins is less beneficial than caching a page for a slightly less frequent but scan-heavy query. As a result, existing caching policies waste valuable memory space to cache input data that offer little-to-no acceleration for analytics.
Hamish Nicholson, Periklis Chrysogelos, Anastasia Ailamaki
DaMoN1