In the book Designing Data Intensive Applications, it says:

By contrast, B-trees break the database down into fixed-size blocks or
pages, traditionally 4 KB in size (sometimes bigger), and read or write one page at a
time.

If the size of each page is fixed, what does the database do if we want to insert data more than its page size? Does it maintain another index to track how many pages each data spans?