In this paper, we propose a new database storage manager, called Buddy-size Segment Storage System (BSSS), to handle large dynamic objects of any size and then implement search, insertion, append, and deletion algorithms used for the storage structure. The internal nodes of the proposed storage manager are identical to the ones proposed in Exodus. However, unlike Exodus that has fixed-size segments for leaf blocks, BSSS has binary buddy-size leaf segments. The proposed storage manager is compared with Exodus through performance results from simulation approach. BSSS performs the same as or better than the best case of Exodus for object creation time, sequential scan time, and random search time. However, the insertion performance of BSSS is the same as or worse than the one of Exodus.