relative address instead of absolute address in the relocation table

Question

In the context of compiler optimization and linker behavior, I'm trying to understand the implications of using relative addresses instead of absolute addresses in the relocation table during the compilation and linking process.

My question is: Why would using relative addresses instead of absolute addresses in the relocation table potentially improve the runtime performance of the program?

Edit:

I noticed that using relative addresses makes fetching quicker because they occupy less memory. However, after fetching, converting relative addresses to absolute ones adds extra processing time. So, I'm wondering why relative addressing is still seen as an improvement despite this additional overhead.