From 5bb3f488dad42534207830d35defa6d45e273b62 Mon Sep 17 00:00:00 2001 From: ZhuangYumin Date: Sun, 3 Dec 2023 15:03:26 +0000 Subject: [PATCH] =?UTF-8?q?upd:=20=E5=BE=AE=E8=B0=83=E4=BA=86=E8=AE=BE?= =?UTF-8?q?=E8=AE=A1=E5=92=8C=E6=9E=B6=E6=9E=84?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- backend/include/{database.h => database.hpp} | 0 backend/include/{drivearray.h => drivearray.hpp} | 0 backend/include/{drivemultimap.h => key2index.hpp} | 0 backend/src/database.cpp | 0 backend/src/drivearray.cpp | 0 backend/src/drivemultimap.cpp | 0 docs/develop/总体设计文档.md | 2 +- 7 files changed, 1 insertion(+), 1 deletion(-) rename backend/include/{database.h => database.hpp} (100%) rename backend/include/{drivearray.h => drivearray.hpp} (100%) rename backend/include/{drivemultimap.h => key2index.hpp} (100%) delete mode 100644 backend/src/database.cpp delete mode 100644 backend/src/drivearray.cpp delete mode 100644 backend/src/drivemultimap.cpp diff --git a/backend/include/database.h b/backend/include/database.hpp similarity index 100% rename from backend/include/database.h rename to backend/include/database.hpp diff --git a/backend/include/drivearray.h b/backend/include/drivearray.hpp similarity index 100% rename from backend/include/drivearray.h rename to backend/include/drivearray.hpp diff --git a/backend/include/drivemultimap.h b/backend/include/key2index.hpp similarity index 100% rename from backend/include/drivemultimap.h rename to backend/include/key2index.hpp diff --git a/backend/src/database.cpp b/backend/src/database.cpp deleted file mode 100644 index e69de29..0000000 diff --git a/backend/src/drivearray.cpp b/backend/src/drivearray.cpp deleted file mode 100644 index e69de29..0000000 diff --git a/backend/src/drivemultimap.cpp b/backend/src/drivemultimap.cpp deleted file mode 100644 index e69de29..0000000 diff --git a/docs/develop/总体设计文档.md b/docs/develop/总体设计文档.md index 608262a..804f40c 100644 --- a/docs/develop/总体设计文档.md +++ b/docs/develop/总体设计文档.md @@ -36,7 +36,7 @@ 能够逻辑上并发地响应需求,并且实际上尽可能并行。每秒可响应1e4次请求。 ##### 数据结构 ###### 底层实现 -通过一个逻辑有序、带一层块级索引的块状链表实现一个键值数据库,相当于`std::multimap`,一个键值数据库实例拥有恰好一个文件 +通过一个哈希表实现一个键值数据库,相当于`std::multimap`,一个键值数据库实例拥有恰好一个文件 ###### 逻辑实现 数据库的一条记录有主键(应当是唯一的)、副键和数据构成,从主键到数据建立multimap,从副键到主键建立multimap,一个数据库实例拥有恰好两个文件,一个数据库可以有多个Sheet,用于逻辑上存储不同的表。