基于粒计算的时间粒建模及其基本运算

he formalism of temporal data is the theoretical fundament for the settlement of time-related big data problems with complicated property. This paper studied the generality towards the analysis of temporal big data from the perspective of binary relation including equivalence relation and linear ordering. A novel information system Temporal Granular System (TGS) is thus proposed . The Hasse diagram is presented after demonstrating that TGS is a complete lattice. This diagram can provide a more intuitive perception to elaborate the syntax of time granular, the basic component of TGS, as well as the intrinsic relation and converted practicability among different time granular. Furthermore, the unary operators, as well as binary operators, are defined and equivalent forms of whose are further deduced. The aforementioned logic and computing operators enable the transformation of time granular in different hierarchies and the relation reasoning of different time granular. Finally, it is proved that TGS, together with its calculus, is a complete lattice algebraic system.