lsmTree LSM-Tree 简介 LSM-Tree（Log-Structured Merge-Tree）是一种为高写入吞吐设计的存储结构，广泛应用于 NoSQL 数据库（如 Leve...

执行引擎概览 FROM deepseek 执行引擎对比表 类型 数据处理方式 优势场景 劣势场景 代表系统 Volcano 逐行处理 OLTP 短查询 复杂分析查询 MySQL、PostgreSQL 向量化 按...

Heap 原理 堆（Heap）是一种基于完全二叉树的数据结构，常用于实现优先队列。它分为两种类型： 最大堆：父节点的值 ≥ 子节点的值 最小堆：父节点的值 ≤ 子...

可串行化的实现思路 paper: https://drkp.net/papers/ssi-vldb12.pdf 可串行化冲突的例子 wr-dependencies: if T1 writes a version of an object, and T2 reads that version, then T1 appears to have executed before T2 ww-dependencies: if T1 writes a version of some object, and T2 replaces that version with the next version, then T1 appears to have executed before T2 rw-antidependencies: if...

2025-03-02 符文般的JS 0 = [+[]]+[] 1 = [+!+[]]+[] 10 = [+!+[]]+[+[]] 100 = [+!+[]]+[+[]]+[+[]] 1. 0 = [+[]]+[]​ ​[]​ 是一个空数组。 ​+[]​ 将空数组转换为数字。空数组转换为数字时是 0​，...