Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleQuery processing algorithms for temporal intersection joins
dc.contributor.authorGunadhi, Himawan
dc.contributor.authorSegev, Arie
dc.identifier.citationGunadhi, Himawan,Segev, Arie (1991). Query processing algorithms for temporal intersection joins. Proceedings - International Conference on Data Engineering : 336-344. ScholarBank@NUS Repository.
dc.description.abstractIntersection 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.
dc.typeConference Paper
dc.contributor.departmentDECISION SCIENCES
dc.description.sourcetitleProceedings - International Conference on Data Engineering
Appears in Collections:Staff Publications

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

Google ScholarTM



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