Some suggest that indexes such as B-Trees and R-Trees should have their node packing at 100% with static data because there will not be much inserts/deletion with static data. However, I am in doubt of this. Maybe there can be disadvantages/counterarguments. For example, even if static data will not change much, it can still change a bit eventually and we should accommodate this by allowing some free space- so there should be high % packing but not necessarily 100%. Is this valid/applicable? Are there other disadvantages to 100% packing?
Page packing on indexes?
database theory;databases;packing