[HTML][HTML] Prescriptive analytics: Literature review and research challenges

K Lepenioti, A Bousdekis, D Apostolou… - International Journal of …, 2020 - Elsevier
Business analytics aims to enable organizations to make quicker, better, and more
intelligent decisions with the aim to create business value. To date, the major focus in the …

Prescriptive analytics: a survey of emerging trends and technologies

D Frazzetto, TD Nielsen, TB Pedersen, L Šikšnys - The VLDB Journal, 2019 - Springer
This paper provides a survey of the state-of-the-art and future directions of one of the most
important emerging technologies within business analytics (BA), namely prescriptive …

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 …

In-memory subgraph matching: An in-depth study

S Sun, Q Luo - Proceedings of the 2020 ACM SIGMOD International …, 2020 - dl.acm.org
We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …

Optimizing subgraph queries by combining binary and worst-case optimal joins

A Mhedhbi, S Salihoglu - Proceedings of the VLDB Endowment, 2019 - dl.acm.org
We study the problem of optimizing subgraph queries using the new worst-case optimal join
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …

The Vadalog system: Datalog-based reasoning for knowledge graphs

L Bellomarini, G Gottlob, E Sallinger - arxiv preprint arxiv:1807.08709, 2018 - arxiv.org
Over the past years, there has been a resurgence of Datalog-based systems in the database
community as well as in industry. In this context, it has been recognized that to handle the …

Learning linear regression models over factorized joins

M Schleich, D Olteanu, R Ciucanu - Proceedings of the 2016 …, 2016 - dl.acm.org
We investigate the problem of building least squares regression models over training
datasets defined by arbitrary join queries on database tables. Our key observation is that …

FAQ: questions asked frequently

M Abo Khamis, HQ Ngo, A Rudra - … of the 35th ACM SIGMOD-SIGACT …, 2016 - dl.acm.org
We define and study the Functional Aggregate Query (FAQ) problem, which encompasses
many frequently asked questions in constraint satisfaction, databases, matrix operations …

Adopting worst-case optimal joins in relational database systems

M Freitag, M Bandle, T Schmidt, A Kemper… - Proceedings of the …, 2020 - dl.acm.org
Worst-case optimal join algorithms are attractive from a theoretical point of view, as they offer
asymptotically better runtime than binary joins on certain types of queries. In particular, they …

{RStream}: Marrying relational algebra with streaming for efficient graph mining on a single machine

K Wang, Z Zuo, J Thorpe, TQ Nguyen… - 13th USENIX Symposium …, 2018 - usenix.org
Graph mining is an important category of graph algorithms that aim to discover structural
patterns such as cliques and motifs in a graph. While a great deal of work has been done …