Fusing similarity models with markov chains for sparse sequential recommendation

R He, J McAuley - 2016 IEEE 16th international conference on …, 2016 - ieeexplore.ieee.org
Predicting personalized sequential behavior is a key task for recommender systems. In order
to predict user actions such as the next product to purchase, movie to watch, or place to visit …

Emptyheaded: A relational engine for graph processing

CR Aberger, A Lamb, S Tu, A Nötzli… - ACM Transactions on …, 2017 - dl.acm.org
There are two types of high-performance graph processing engines: low-and high-level
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …

Decoding billions of integers per second through vectorization

D Lemire, L Boytsov - Software: Practice and Experience, 2015 - Wiley Online Library
In many important applications—such as search engines and relational database systems—
data are stored in the form of arrays of integers. Encoding and, most importantly, decoding of …

Hedgecut: Maintaining randomised trees for low-latency machine unlearning

S Schelter, S Grafberger, T Dunning - Proceedings of the 2021 …, 2021 - dl.acm.org
Software systems that learn from user data with machine learning (ML) have become
ubiquitous over the last years. Recent law such as the" General Data Protection …

Rethinking SIMD vectorization for in-memory databases

O Polychroniou, A Raghavan, KA Ross - Proceedings of the 2015 ACM …, 2015 - dl.acm.org
Analytical databases are continuously adapting to the underlying hardware in order to
saturate all sources of parallelism. At the same time, hardware evolves in multiple directions …

Photon: A fast query engine for lakehouse systems

A Behm, S Palkar, U Agarwal, T Armstrong… - Proceedings of the …, 2022 - dl.acm.org
Many organizations are shifting to a data management paradigm called the" Lakehouse,"
which implements the functionality of structured data warehouses on top of unstructured …

FAST: fast architecture sensitive tree search on modern CPUs and GPUs

C Kim, J Chhugani, N Satish, E Sedlar… - Proceedings of the …, 2010 - dl.acm.org
In-memory tree structured index search is a fundamental database operation. Modern
processors provide tremendous computing power by integrating multiple cores, each with …

Sort vs. hash revisited: Fast join implementation on modern multi-core CPUs

C Kim, T Kaldewey, VW Lee, E Sedlar… - Proceedings of the …, 2009 - dl.acm.org
Join is an important database operation. As computer architectures evolve, the best join
algorithm may change hand. This paper re-examines two popular join algorithms--hash join …

Data blocks: Hybrid OLTP and OLAP on compressed storage using both vectorization and compilation

H Lang, T Mühlbauer, F Funke, PA Boncz… - Proceedings of the …, 2016 - dl.acm.org
This work aims at reducing the main-memory footprint in high performance hybrid OLTP &
OLAP databases, while retaining high query performance and transactional throughput. For …

Breaking the memory wall in MonetDB

PA Boncz, ML Kersten, S Manegold - Communications of the ACM, 2008 - dl.acm.org
In the past decades, advances in speed of commodity CPUs have far outpaced advances in
RAM latency. Main-memory access has therefore become a performance bottleneck for …