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 …

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 …

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 …

Relaxed operator fusion for in-memory databases: Making compilation, vectorization, and prefetching work together at last

P Menon, TC Mowry, A Pavlo - Proceedings of the VLDB Endowment, 2017 - dl.acm.org
In-memory database management systems (DBMSs) are a key component of modern on-
line analytic processing (OLAP) applications, since they provide low-latency access to large …

iDO: Compiler-directed failure atomicity for nonvolatile memory

Q Liu, J Izraelevitz, SK Lee, ML Scott… - 2018 51st Annual …, 2018 - ieeexplore.ieee.org
This paper presents iDO, a compiler-directed approach to failure atomicity with nonvolatile
memory. Unlike most prior work, which instruments each store of persistent data for redo or …

A study of the fundamental performance characteristics of GPUs and CPUs for database analytics

A Shanbhag, S Madden, X Yu - Proceedings of the 2020 ACM SIGMOD …, 2020 - dl.acm.org
There has been significant amount of excitement and recent work on GPU-based database
systems. Previous work has claimed that these systems can perform orders of magnitude …

Everything you always wanted to know about compiled and vectorized queries but were afraid to ask

T Kersten, V Leis, A Kemper, T Neumann… - Proceedings of the …, 2018 - dl.acm.org
The query engines of most modern database systems are either based on vectorization or
data-centric code generation. These two state-of-the-art query processing paradigms are …

Voodoo-a vector algebra for portable database performance on modern hardware

H Pirk, O Moll, M Zaharia, S Madden - Proceedings of the VLDB …, 2016 - dl.acm.org
In-memory databases require careful tuning and many engineering tricks to achieve good
performance. Such database performance engineering is hard: a plethora of data and …

Integration of FPGAs in database management systems: challenges and opportunities

A Becher, L BG, D Broneske, T Drewes… - Datenbank …, 2018 - Springer
In the presence of exponential growth of the data produced every day in volume, velocity,
and variety, online analytical processing (OLAP) is becoming increasingly challenging …

Query processing on tensor computation runtimes

D He, S Nakandala, D Banda, R Sen, K Saur… - arXiv preprint arXiv …, 2022 - arxiv.org
The huge demand for computation in artificial intelligence (AI) is driving unparalleled
investments in hardware and software systems for AI. This leads to an explosion in the …