![]() ![]() So, a page of 8kB will end up storing just a few elements, therefore wasting a lot of space, both on the disk and in the database memory, as index pages could be cached in the Buffer Pool. Index pages will have a very low fill factor because the values come randomly.However, indexing random values using B+Tree causes a lot of problems: Second, the Primary Key column usually has an associated B+Tree index to speed up lookups or joins, and B+Tree indexes store data in sorted order. Every single record will need 16 bytes for the database identifier, and this impacts all associated Foreign Key columns as well. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |