Taming Time: Using Correspondence Analysis to handle relative chronologies as graphs

“Dated sites” in archaeology are usually not “dated sites”. Most of the temporality of “dated sites” is usually derived from historical assumptions. However, the chronology of these materials is often based on material coming from the manifold of other assumed “dated sites”, thus potentially resulting in a circulus vitiosus. A methodological way out of this dilemma is possible when we enhance the assumed external dating evidence and go back to the factual occurrences and overlaps in the data from the suspected “dated sites” since only these data are free of any temporal interpretations.As a method, the chronological assumptions used in defining “dated sites” based on archaeological find materials must be deconstructed and restricted to the occurrences and overlaps within and between “find materials” from suspected “dated sites” only to arrive at a relative chronology. This can be achieved by using correspondence analysis and visualising the resulting dimension values on maps recalculated in Hue values. By applying Allen’s interval algebra, including the Alligator and AMT tools, we can fix missing or enhance existing start- or endpoints by adding information about the vagueness/uncertainties.To cover as many assumed “dated sites” as possible, the Samian Research database with its 250,000 potter’s stamps from all over Europe is used.It turns out that it is possible to visualise historical development on maps, timelines and graph structures without using historical-chronological assumptions about individual “dated sites”. Simultaneously, this paper demonstrates the application of a different concept of temporality. The development of the Samian consumption patterns in the progressing Southern German Limes and the enrollment of the occupation of Britain appears to be gradual only. Applying the methods above, based on Linked Open Data techniques, enables the FAIRification of these data related to temporality, especially by creating interoperability and reproducibility.