822 citations · 872 across the 10 of their papers we have counts for
9 papers · 1 filter
Simpli-Squared: A Very Simple Yet Unexpectedly Powerful Join Ordering Algorithm Without Cardinality Estimates
Asoke Datta, Yesdaulet Izenov, Brian Tsan +1
The Join Order Benchmark (JOB) has become the de facto standard to assess the performance of relational database query optimizers due to its complexity and completeness. In order t…
Online Sketch-based Query Optimization
Yesdaulet Izenov, Asoke Datta, Florin Rusu +1
Cost-based query optimization remains a critical task in relational databases even after decades of research and industrial development. Query optimizers rely on a large range of s…
In-Depth Benchmarking of Graph Database Systems with the Linked Data Benchmark Council (LDBC) Social Network Benchmark (SNB)
Florin Rusu, Zhiyi Huang
In this study, we present the first results of a complete implementation of the LDBC SNB benchmark -- interactive short, interactive complex, and business intelligence -- in two na…
Exact Selectivity Computation for Modern In-Memory Database Query Optimization
Jun Hyung Shin, Florin Rusu, Alex Suhan
Selectivity estimation remains a critical task in query optimization even after decades of research and industrial development. Optimizers rely on accurate selectivities when gener…
Distributed Caching for Complex Querying of Raw Arrays
Weijie Zhao, Florin Rusu, Bin Dong +3
As applications continue to generate multi-dimensional data at exponentially increasing rates, fast analytics to extract meaningful results is becoming extremely important. The dat…
Stochastic Gradient Descent on Highly-Parallel Architectures
Yujing Ma, Florin Rusu, Martin Torres
There is an increased interest in building data analytics frameworks with advanced algebraic capabilities both in industry and academia. Many of these frameworks, e.g., TensorFlow…