This paper presents a new, simple, and efficient data structure, namely, the \b{o}rdered \b{s}egment (OS): a mono dimensional string array that we have been using in our classification of big data. The essential idea in construction of OS is to make use of the redundancies that abound user-data. OS enables us to performs efficient retrieval, insertions and deletions of data. The theoretical and experimental observations show that the method presented is more practical than existing ones considering the use of dynamic string sets for the classifications of huge user-files.