The case for learned index structures
Indexes are models: a\btree-Index can be seen as a model to map a key to the position of a
record within a sorted array, a Hash-Index as a model to map a key to a position of a record …
record within a sorted array, a Hash-Index as a model to map a key to a position of a record …
The snowflake elastic data warehouse
B Dageville, T Cruanes, M Zukowski… - Proceedings of the …, 2016 - dl.acm.org
We live in the golden age of distributed computing. Public cloud platforms now offer virtually
unlimited compute and storage resources on demand. At the same time, the Software-as-a …
unlimited compute and storage resources on demand. At the same time, the Software-as-a …
Fiting-tree: A data-aware index structure
Index structures are one of the most important tools that DBAs leverage to improve the
performance of analytics and transactional workloads. However, building several indexes …
performance of analytics and transactional workloads. However, building several indexes …
The vertica analytic database: C-store 7 years later
A Lamb, M Fuller, R Varadarajan, N Tran… - arXiv preprint arXiv …, 2012 - arxiv.org
This paper describes the system architecture of the Vertica Analytic Database (Vertica), a
commercialization of the design of the C-Store research prototype. Vertica demonstrates a …
commercialization of the design of the C-Store research prototype. Vertica demonstrates a …
[PDF][PDF] MonetDB/X100: Hyper-Pipelining Query Execution.
PA Boncz, M Zukowski, N Nes - Cidr, 2005 - researchgate.net
Database systems tend to achieve only low IPC (instructions-per-cycle) efficiency on modern
CPUs in compute-intensive application areas like decision support, OLAP and multimedia …
CPUs in compute-intensive application areas like decision support, OLAP and multimedia …
Amazon redshift and the case for simpler data warehouses
A Gupta, D Agarwal, D Tan, J Kulesza… - Proceedings of the …, 2015 - dl.acm.org
Amazon Redshift is a fast, fully managed, petabyte-scale data warehouse solution that
makes it simple and cost-effective to efficiently analyze large volumes of data using existing …
makes it simple and cost-effective to efficiently analyze large volumes of data using existing …
A structured review of data management technology for interactive visualization and analysis
L Battle, C Scheidegger - IEEE transactions on visualization …, 2020 - ieeexplore.ieee.org
In the last two decades, interactive visualization and analysis have become a central tool in
data-driven decision making. Concurrently to the contributions in data visualization …
data-driven decision making. Concurrently to the contributions in data visualization …
Data blocks: Hybrid OLTP and OLAP on compressed storage using both vectorization and compilation
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 …
OLAP databases, while retaining high query performance and transactional throughput. For …
TPC-H analyzed: Hidden messages and lessons learned from an influential benchmark
The TPC-D benchmark was developed almost 20 years ago, and even though its current
existence as TPC-H could be considered superseded by TPC-DS, one can still learn from it …
existence as TPC-H could be considered superseded by TPC-DS, one can still learn from it …
Fine-grained partitioning for aggressive data skipping
Modern query engines are increasingly being required to process enormous datasets in
near real-time. While much can be done to speed up the data access, a promising technique …
near real-time. While much can be done to speed up the data access, a promising technique …