I would like to understand how the db package with btree algorithm ( dbopen ) handles data that is greater than one block size. I assume the block size to be the pagesize, which is 4096 bytes. From the man pages (man dbopen)

"Key and data byte strings may reference strings of essentially unlimited length although any two of them must fit into available memory at the same time. "

For example, how about storing 4103 bytes of data using the btree algorithm, assuming both key and data are of the same size, which is 4103.

--Thanks.