杂七杂八的，随手记录。

ByteHTAP: ByteDance’s HTAP System with High Data Freshness and Strong Data Consistency

yc 发布于 0001-01-01

Table of Contents

1 INTRODUCTION
2 RELATED WORK
3 SYSTEM ARCHITECTURE
- 3.1 ByteNDB Overview
- 3.2 System Overview
- 3.3 Metadata Service
- 3.4 OLAP Engine
4 SHARED STORAGE WITH HIGH DATA FRESHNESS
- 4.1 Delta Store
- 4.2 Base Store
- 4.3 High Data Freshness
5 LSN-BASED STRONG DATA CONSISTENCY
6 OLAP QUERY PERFORMANCE OPTIMIZATION

本文为摘录(或转载)，侵删，原文为： ../pdf/5/p3411-chen.pdf

Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation

yc 发布于 0001-01-01

Table of Contents

1 ABSTRACT
2 INTRODUCTION
3 PRELIMINARIES AND BACKGROUND
4 EVALUATION PLAN
- 4.1 CardEst Algorithms

本文为摘录(或转载)，侵删，原文为： attachments/pdf/2/p752-zhu.pdf

1 ABSTRACT

we compare the effectiveness of CardEst methods in a real DBMS
We establish a new benchmark for CardEst, which:
- contains a new complex realworld dataset STATS and
- a diverse query workload STATS-CEB.
We integrate multiple most representative CardEst methods into PostgreSQL,

cgroup memo

yc 发布于 0001-01-01

Table of Contents

1 Threads (Tasks (threads) versus processes)
- 1.1 cgroup v2 线程限制

1 Threads (Tasks (threads) versus processes)

cgroup v1 可以单独操作进程中的线程, man cgroups :

In cgroups v1, a distinction is drawn between processes and tasks. In this view, a process can con‐ sist of multiple tasks (more commonly called threads, from a user-space perspective, and called such in the remainder of this man page). In cgroups v1, it is possible to independently manipulate the cgroup memberships of the threads in a process.

Chimp: Efficient Lossless Floating Point Compression for Time Series Databases

yc 发布于 0001-01-01

Table of Contents

1 ABSTRACT
2 INTRODUCTION
3 PRELIMINARIES
4 PROPERTIES OF REAL-WORLD TIME SERIES
- 4.1 Trailing Zeros
- 4.2 Leading Zeros
- 4.3 Revisiting Gorilla Compression
5 OVERVIEW
- 5.1 Our Chimp Algorithm
6 效果对比
- 6.1 Compression size result
- 6.2 Compression and decompression time

本文为摘录(或转载)，侵删，原文为： attachments/pdf/1/p3058-liakos.pdf

1 ABSTRACT

时序数据难以高效存储，导致存储代价高昂。

Columnar Formats for Schemaless LSM-based Document Stores

yc 发布于 0001-01-01

Table of Contents

1 INTRODUCTION
2 BACKGROUND
- 2.1 Apache AsterixDB

本文为摘录(或转载)，侵删，原文为： attachments/pdf/f/p2085-alkowaileet.pdf

这篇论文探讨了文档存储数据库系统的数据模型灵活性限制其在列式关系数据库中进行分析工作负载的表现。作者提出了几种基于Log-Structured Merge (LSM) tree事件的技术，旨在将数据存储在列式布局中。他们扩展了Dremel格式并引入一个新的列式布局来组织和存储数据。论文还强调了在文档存储中使用查询编译技术的潜力，并介绍了他们在Apache AsterixDB中的实现和评估。实验结果显示了显著的性能增益，并在最小程度上影响了摄入性能。