Using Dominance Searching to Speed up Temporal Join Operation

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Journal Artical > Item 310904400/6417

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/6417

Title:	Using Dominance Searching to Speed up Temporal Join Operation
Authors:	Chen, C. Y.;Hu, J. F.;Chang, C. C.
Keywords:	Temporal relation;Temporal join operation;Time interval intersection searching problem;Dominance searching problem
Date:	2008-02
Issue Date:	2009-12-17 06:57:51 (UTC+0)
Publisher:	Asia University
Abstract:	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
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Artical

Files in This Item:

File	Description	Size	Format
		0Kb	Unknown	471	View/Open
310904400-6417 .doc		34Kb	Microsoft Word	303	View/Open