Embedded devices collect and process significant amounts of data in a variety of applications including environmental monitoring, industrial automation and control, and other Internet of Things (IoT) applications. Storing data efficiently is critically important, especially when the device must perform local processing on the data. The most widely used data structure for high performance query and insert is the B-tree. However, existing implementations consume too much memory for small embedded devices and often rely on operating system support. This work presents an extremely memory efficient implementation of B-trees for embedded devices that functions on the smallest devices and does not require an operating system. Experimental results demonstrate that the B-tree implementation can run on devices with as little as 4 KB of RAM while efficiently processing thousands of records.

翻译：嵌入式设备在环境监测、工业自动化与控制及其他物联网应用中收集并处理大量数据。当设备需对数据进行本地处理时，高效存储数据至关重要。高性能查询与插入最广泛使用的数据结构是B树。然而，现有实现方式对小型嵌入式设备而言消耗内存过多，且通常依赖操作系统支持。本文提出一种面向嵌入式设备的极高内存效率B树实现方案，该方案能在最小型设备上运行且无需操作系统支持。实验结果表明，该B树实现可运行于仅4KB RAM的设备上，同时高效处理数千条记录。