杂七杂八的，随手记录。

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中的实现和评估。实验结果显示了显著的性能增益，并在最小程度上影响了摄入性能。

Coping with the TCP TIME-WAIT state on busy Linux servers

yc 发布于 0001-01-01

Table of Contents

1 TL;DR
2 About the TIME-WAIT state
- 2.1 TCP state diagram
- 2.2 Purpose
3 Problems
4 Other solutions
- 4.1 net.ipv4.tcp_tw_reuse
5 Another
6 总结

本文为摘录(或转载)，侵删，原文为： https://vincent.bernat.ch/en/blog/2014-tcp-time-wait-state-linux#summary

1 TL;DR

不用启用 net.ipv4.tcp_tw_recycle ，该选项已在 Linux4.12 废弃
多数情况下， TIME-WAIT 状态的 socket 无害

2 About the TIME-WAIT state

2.1 TCP state diagram

http://tcpipguide.com/free/t_TCPOperationalOverviewandtheTCPFiniteStateMachineF-2.htm

Data Structures in PG

yc 发布于 0001-01-01

Table of Contents

1 Hash & TapeSet
2 Slot & tuple

1 Hash & TapeSet

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67

class LogicalTapeSet {
    + BufFile pfile
    + SharedFileSet fileset
    + int worker
    + long nBlocksAllocated
    + long nBlocksWritten
    + long nHoleBlocks
    + bool forgetFreeSpace
    + long freeBlocks
    + long nFreeBlocks
    + Size freeBlocksLen
    + bool enable_prealloc
}

class LogicalTape {
    + LogicalTapeSet tapeSet
    + bool writing
    + bool frozen
    + bool dirty
    + long firstBlockNumber
    + long curBlockNumber
    + long nextBlockNumber
    + long offsetBlockNumber
    + char buffer
    + int buffer_size
    + int max_size
    + int pos
    + int nbytes
    + long prealloc
    + int nprealloc
    + int prealloc_size
}



class BufFile {
    + int numFiles
    + File files
    + bool isInterXact
    + bool dirty
    + bool readOnly
    + FileSet fileset
    + const name
    + ResourceOwner resowner
    + int curFile
    + off_t curOffset
    + int pos
    + int nbytes
    + PGAlignedBlock buffer
}

LogicalTapeSet *-- BufFile

class HashAggSpill {
+ int npartitions
+ LogicalTape partitions
+ int64 ntuples
+ uint32 mask
+ int shift
+ hyperLogLogState hll_card
}


HashAggSpill *-- LogicalTape

LogicalTape - LogicalTapeSet

2 Slot & tuple

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87

class TupleTableSlot {
  + NodeTag type
  + int tts_flags
  + AttrNumber tts_nvalid
  + const tts_ops
  + TupleDesc tts_tupleDescriptor
  + int tts_values
  + int tts_isnull
  + int tts_mcxt
  + ItemPointerData tts_tid
  + int tts_tableOid
}




class MinimalTupleData {
  + int t_len
  + char mt_padding
  + int t_infomask2
  + int t_infomask
  + int t_hoff
  + int t_bits
}


class HeapTupleHeaderData {
  + union t_choice
  + ItemPointerData t_ctid
  + int t_infomask2
  + int t_infomask
  + int t_hoff
  + int t_bits
}

class union {
  + HeapTupleFields t_heap
  + DatumTupleFields t_datum
}


HeapTupleHeaderData *-- union

class MinimalTupleTableSlot {
  + TupleTableSlot base
  + HeapTuple tuple
  + MinimalTuple mintuple
  + HeapTupleData minhdr
  + int off
}

class HeapTupleData {
  + int t_len
  + ItemPointerData t_self
  + int t_tableOid
  + HeapTupleHeader t_data
}


class VirtualTupleTableSlot {
  + TupleTableSlot base
  + char data
}

class HeapTupleTableSlot {
  + TupleTableSlot base
  + HeapTuple tuple
  + int off
  + HeapTupleData tupdata
}

class BufferHeapTupleTableSlot {
  + HeapTupleTableSlot base
  + Buffer buffer
}


TupleTableSlot <|-- MinimalTupleTableSlot
TupleTableSlot <|-- VirtualTupleTableSlot
TupleTableSlot <|-- HeapTupleTableSlot
HeapTupleTableSlot <|-- BufferHeapTupleTableSlot


MinimalTupleTableSlot *-- MinimalTupleData
HeapTupleTableSlot *-- HeapTupleData
HeapTupleData *-- HeapTupleHeaderData

Design Trade-offs for a Robust Dynamic Hybrid Hash Join

yc 发布于 0001-01-01

Table of Contents

1 ABSTRACT
2 INTRODUCTION
3 BACKGROUND
- 3.1 Hybrid Hash Join

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

1 ABSTRACT

探索分片数量对 HHJ 性能的影响
propose a new lower bound for number of partitions
design and evaluate different partition insertion techniques to maximize memory utilization with the lest CPU cost

2 INTRODUCTION

HHJ: Hybrid Hash Join

GitHub - powa-team/powa: PostgreSQL Workload Analyzer

yc 发布于 0001-01-01

本文为摘录(或转载)，侵删，原文为： https://github.com/powa-team/powa

Workload Analyzer.