題名: Two Dominance Searching Based Temporal Join Algorithms
作者: Chen, C. Y.
Hu, J. F.
關鍵字: Temporal database
temporal join
dominance searching
期刊名/會議名稱: 1996 ICS會議
摘要: In this paper, we are concerned with the problem of efficient processing of temporal join operation relations. 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 a dominance searching problem in the plane. Then, by using an efficient data structure for solving the dominance searching problem as an index for the inner relations, we propose a new nested-loops based temporal join algorithm. For the cases where the index for the inner relations is too large to fit in the primary memory, we propose anther partition_based temporal join algorithm which doesn't 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 strong of tuples and direct access of matching tuples.
日期: 2006-10-24T06:54:18Z
分類:1996年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics001996000025.pdf772.24 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。