Conflict-Free Replicated Data Types (CRDT) is a popular approach for underpinning group editing in many applications, providing features such as peer-to-peer and offline editing. While conventional approaches such as Operation Transformation (OT) can be challenging to implement those features, CRDT still faces a critical issue - inefficient data retrieval due to storing data in a data structure with linear complexity. To address the issue, we propose a novel retrieval algorithm called Relative Distance Skip List (RDSL). This algorithm utilizes a probabilistic balancing identifier structure, which is based on relative distances between original CRDT nodes. The RDSL algorithm is both time- and space-efficient, providing a stable and efficient solution for data retrieval in CRDT.