The article explains Elasticsearch’s internal Doc Values column‑store structure, why it outperforms the inverted index for sorting and aggregation, how it is generated, stored, compressed, and used in queries, and provides practical mapping examples.
This article explains how column store indexes in SQL Server store each column separately, dramatically improve query performance through batch processing and compression, outlines their physical structure, encoding methods, creation syntax, maintenance steps, and space usage considerations.
The article explains the fundamental differences between row‑based and column‑based storage in databases, compares their write and read performance, presents a practical openGauss experiment showing storage size and insert speed differences, and offers guidance on when to choose each model.
This article explains the fundamental differences between row‑based and column‑based storage in relational databases, compares their performance for writes, reads, compression and use cases, presents an openGauss experiment with sample tables and SQL commands, and offers practical guidance on when to choose each storage model.
This article compares row‑based and column‑based storage models, analyzes their write and read performance, presents a practical openGauss experiment showing size and insert‑time differences, and offers concrete guidance on selecting the appropriate storage type for various workloads.
This article explains the differences between row-based and column-based storage in databases, compares their advantages and disadvantages, presents experimental results using openGauss including space usage and insert performance, and offers practical guidance on selecting the appropriate storage model for various workloads.
This article explains the fundamental differences between row‑based and column‑based storage in databases, compares their read/write performance, presents experimental results on openGauss showing space and speed trade‑offs, and offers practical guidance on when to choose each storage model.
This article explains how PolarDB MySQL introduces an In‑Memory Column Index (IMCI) to combine row‑store OLTP strength with column‑store analytical speed, detailing the architectural innovations, optimizer decisions, data organization, resource isolation strategies, and benchmark results that show IMCI achieving tens to hundreds of times faster query execution than native MySQL and matching ClickHouse performance.
This article explores PolarDB MySQL’s In‑Memory Column Index (IMCI) technology, detailing its hybrid row‑column storage architecture, optimizer enhancements, parallel execution engine, and performance gains that enable real‑time analytical queries alongside OLTP workloads, and compares its benchmarks against MySQL and ClickHouse.
This article explains Oracle 12c's In‑Memory Column Store feature, its compression levels, step‑by‑step testing results for full scans and joins, a real‑world production case from Zhejiang Mobile, and practical maintenance commands to keep the in‑memory area healthy.
