This paper is concerned with the problem of efficient processing of temporal
join operation on temporal relation. By mapping time intervals to points in the plane,
we first show that the problem of determining the set of all matching tuples of a temporal
join is equivalent to the dominance searching problem in the plane. Then, by using an efficient
data structure for solving the equivalent dominance searching problem as an index
for the inner relation, we propose a nested-loops temporal join algorithm. For the case
where the index for the inner relations too large to fit in the primary memory, we propose
another partition-based temporal join algorithm which does not need any index for the
operand relations. Finally, in order to provide more efficient processing of temporal join,
we propose a cluster scheme and an index scheme to support efficient storage of tuples
and direct access of matching tuples.
Relation:
International Journal of Innovative Computing, Information and Control 4(2):335-350
