Ordered Segments for Classification of Big Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Ordered Segments for Classification of Big Data


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.
Not file

Dates and versions

hal-00921576 , version 1 (20-12-2013)


  • HAL Id : hal-00921576 , version 1


Abolfazl Fatholahzadeh. Ordered Segments for Classification of Big Data. ICMLA'13, Dec 2013, Miami, Florida, United States. pp.268-272. ⟨hal-00921576⟩
59 View
0 Download


Gmail Facebook Twitter LinkedIn More