Abstract
We present a framework for parallel temporal joins. The temporal join is a key operator for temporal processing. Efficient implementations are required in order to make temporal database features attractive and applicable for the many applications that are amenable.
We focus on the temporal intersection as the supertype of temporal joins. In contrast to traditional equi-joins, parallel temporal join processing suffers from tuples being replicated between data fragments. This causes a significant overhead.
A basic parallel temporal join strategy — derived from traditional approaches — is refined by two optimisations. The quantitative impacts of the optimisations are evaluated. It is shown that both optimisations together decrease the basic costs significantly.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Allen. Maintaining Knowledge about Temporal Intervals.CACM, 26 (11): 832 – 843, Nov. 1983.
D. DeWitt, J. Naughton, D. Schneider, S. Seshradi. Practical Skew Handling in Parallel Joins. InProc. 18th VLDB, pp. 27–40, Aug. 1992.
H. Gunadhi, A. Segev. A Framework for Query Optimization in Temporal Databases. InProc. 5th Int. Conf. on Stat, and Sclent. Datahase Management, pp. 131–147, Apr. 1990.
H. Gunadhi, A. Segev. Query Processing Algorithms for Temporal Intersection Joins. InProc. 7th Int. Conf. on Data Eng., pp. 336–344, Apr. 1991.
K. Hua, C. Lee. Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning. InProc. 17th VLDB, Sept. 1991.
K. Hua, C. Lee, J.-K. Peir. Interconnecting Shared-Everything Systems for Efficient Parallel Query Processing. In Proc.1st Int. Conf. on Parallel Distr. Inf. Syst., pp. 262–270, Dec. 1991.
C. Jensen, M. Soo, R. Snodgrass. Unifying Temporal Data Models via a Conceptual Model.Information Systems, 19(7)513–547,1994.
T. Leung, R. Muntz. Query Processing for Temporal Databases. InProc. 6th Int. Conf. on Data Eng., pp. 200–208, Feb. 1990.
T. Leung, R. Muntz. Temporal Query Processing and Optimization in Multiprocessor Database Machines. InProc. 18th VLDB, pp. 383–394, Aug. 1992.
H. Lu, B.-C. Ooi, K.-L. Tan. On Spatially Partitioned Temporal Join. InProc. 20th VLDB, pp. 546–557, Sept. 1994.
P. Mishra, M. Eich. Join Processing in Relational Databases.ACM Computing Surveys, pp. 63–113, Mar. 1992.
S. Rana, F. Fotouhi. Efficient Processing of Time-Joins in Temporal Data Bases. InProc. 3rd Int. Symp. on DB Systems for Advanced Appl., pp. 427–432, Apr. 1993.
M. Soo, R. Snodgrass, C. Jensen. Efficient Evaluation of the Valid-Time Natural Join. InProc. 10th Int. Conf. on Data Eng., pp. 282-292, Feb. 1994.
V. Tsotras, A. Kumar. Temporal Database Bibliography Update.SIGMOD Record, 25(1), Mar. 1996.
T. Zurek. Parallel Temporal Nested-Loop Joins. Technical Report ECS-CSG-20-96, Dept. of Computer Science, Edinburgh University, Jan. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zurek, T. (1997). Parallel Temporal Joins (Kurzbeitrag). In: Dittrich, K.R., Geppert, A. (eds) Datenbanksysteme in Büro, Technik und Wissenschaft. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60730-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-60730-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62569-8
Online ISBN: 978-3-642-60730-1
eBook Packages: Springer Book Archive