Scheduling Issues in Partitioned Temporal Join
One of the major problems of temporal databases is to develop efficient algorithms for operations that involves the time attributes. An operation that has received much attention in recent years is the temporal join which matches records from two temporal relations whose time intervals overlap. Under a partition-based algorithm, temporal data are split into partitions. During the join process, a partition in one relation only needs to join with some, but not all, partitions of the other...[Show more]
|Collections||ANU Research Publications|
|1616-01.2003-07-08T23:42:39Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-95-02.pdf||305.85 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.