The KipSQL database project requires an SQL layer that includes a user interface, parser, optimizer, and executor. The parser must include semantic analysis to validate the legality of the abstract syntax tree. The optimizer must quickly find the most efficient query execution plan based on the cost model. The executor must execute the physical plan by sending read and write requests to the underlying kv storage. Future research includes processing a table to key-value mapping relationship and implementing a push-based execution vector execution model similar to DUCKDB.

可扩展哈希是一种动态哈希技术，随着哈希表的大小增加，哈希函数会被修改。它通常用于数据库系统中实现索引。在可扩展哈希中，每个桶可以存储多个记录，每个桶由一个本地目录标识。全局目录跟踪本地目录，并在桶的数量增加时进行扩展。插入数据的过程包括哈希、桶满时的目录扩容、局部深度和全局深度的比较、局部深度增加和桶拆分等步骤。