Improved performance with small objects

PSS has advantages over FSS as it uses a predictable access pattern to store and retrieve data.

• A read operation requires a single seek to find the location of a bin containing the requested slice on a disk.
• A write operation always appends the content of a slice as part of an associated bin to a bin file based on hash value for this slice name. If an affected bin already exists, it has to be first read, then modified with the content of the new slice and then appended to the bin file. Checking for the existence of a bin prior to a write operation does not require disk access or any I/O operations.

PSS exhibits far less performance degradation than FSS over the system lifetime. Read and write operation performance does not degrade due to number of objects. During compaction, performance could degrade temporarily.