Using Dominance Searching to Speed up Temporal Join Operation

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6417

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6417

題名:	Using Dominance Searching to Speed up Temporal Join Operation
作者:	Chen, C. Y.;Hu, J. F.;Chang, C. C.
關鍵詞:	Temporal relation;Temporal join operation;Time interval intersection searching problem;Dominance searching problem
日期:	2008-02
上傳時間:	2009-12-17 06:57:51 (UTC+0)
出版者:	Asia University
摘要:	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.
關聯:	International Journal of Innovative Computing, Information and Control 4(2):335-350
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
		0Kb	Unknown	471	檢視/開啟
310904400-6417 .doc		34Kb	Microsoft Word	303	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.