Each number in your btree would actually be a key-value pair. So you can find the key fast, and then you have the value. Databases including SQLite usually use

Each number in your btree would actually be a key-value pair. So you can find the key fast, and then you have the value. Databases including SQLite usually use b+tree for tables (a variant where only the leaves have data, the interior nodes only have keys) and regular btrees for indexes.