Periodicity is a wide spread phenomenon in real world and very common in a large number of different applications and domains (e.g. finance and healthcare). Generally, periodicity and periodic specifications respectively characterize activities consisting of regularly recurrent elements. In this context, expressiveness of the chosen formalism for describing periodic schemes (i.e., what kind of periodic specifications are covered) is only one side of the coin. The other and more challenging one concerns the ability to efficiently compare periodic specifications among each other. This constitutes an important issue in a high number of applications; e.g., to identify upcoming conflicts between different periodic specifications like conflicts in time or task schedules or bottlenecks regarding resources (e.g. rooms, devices, people). An aggravating factor is the use of different temporal granularities as well as the occurrence of exceptions in periodic specifications. In addition real world scenarios typically have to deal with a high number of periodic specifications. Thus, comparisons between periodic specifications must retain their efficiency also in case of large data sets. In this research project all aspects concerned with the support of periodicity in information systems were systematically examined and powerful solution approaches were developed.