On Spatially Partitioned Temporal Join
Hongjun Lü, Beng Chin Ooi, Kian‐Lee Tan · 1994
This paper presents an innovative partition-based time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to points in a two dimensional space and partitions the space into subspaces. Tu-pies of a temporal relation are clustered into partitions based on the mapping in the space. As a result, when two temporal relations are to be joined over the time attribute, a parti-tion in one relation only needs to be compared with a predetermined set of partitions of the other relation. The mapping scheme and the join algorithms are described. The use of spa-tial indexing techniques to support direct ac-cess to the stored partitions is discussed. The results of a preliminary performance study in-dicate the efficiency of the proposed method. 1