Please use this identifier to cite or link to this item:
Title: Query processing algorithms for temporal intersection joins
Authors: Gunadhi, Himawan 
Segev, Arie
Issue Date: 1991
Citation: Gunadhi, Himawan,Segev, Arie (1991). Query processing algorithms for temporal intersection joins. Proceedings - International Conference on Data Engineering : 336-344. ScholarBank@NUS Repository.
Abstract: Intersection join processing in temporal relational databases is investigated. An analysis is presented of the characteristics and processing requirements of three types of intersection join operators: the time-join, temporal equijoin on the surrogate, and temporal equijoin on the temporal attribute. Based on the physical organization of the database and on the semantics of the operators, several algorithms were developed to process these joins efficiently. The primary cost variables were identified for each algorithm, and their performance is compared to that of a conventional nested-loop join procedure. It is shown that the algorithms developed can reduce processing costs significantly.
Source Title: Proceedings - International Conference on Data Engineering
ISBN: 0818621389
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Sep 22, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.