A data sorted method for the rough relational databases

Abstract

According to the characteristics of the data of rough relational databases, it was put forward a sorted method for uncertainty data. It was by means of the data of the equivalence class, and according to the property such as size, depth, good or bad etc in the database to sort. In sorted time, data of ordered sequence and disordered sequence matching with the data of equivalence class and determined the position of data of the disordered sequence in the ordered sequence, then implement the sort of the rough relational databases. Searched speed can be improved greatly after sort. At the same time, sorted algorithm was given and an example to illustrate the feasibility and effectiveness of the sorted method. © 2011 Springer-Verlag.