Definition
Temporal coalescing is a unary operator applicable to temporal databases that is similar to duplicate elimination in conventional databases. Temporal coalescing merges value-equivalent tuples, i.e., tuples with overlapping or adjacent timestamps and matching explicit attribute values. Tuples in a temporal relation that agree on the explicit attribute values and that have adjacent or overlapping timestamps are candidates for temporal coalescing. The result of operators may change if a relation is coalesced before applying the operator. For instance, an operator that counts the number of tuples in a relation or an operator that selects all tuples with a timestamp spanning at least 3 months are sensitive to temporal coalescing.
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 subscriptionsRecommended Reading
Allen JF. Maintaining knowledge about temporal intervals. Commun ACM. 1983;16(11):832–43.
Böhlen MH, Snodgrass RT, Soo MD. Coalescing in temporal databases. In: Proceedings of the 22th International Conference on Very Large Data Bases; 1996. p. 180–91.
Böhlen MH, Jensen CS, Snodgrass RT. Temporal statement modifiers. ACM Trans Database Syst. 2000;25(4):48.
Celko J. SQL for smarties: advanced SQL programming. San Francisco: Morgan Kaufmann; 1995.
Leung C, Muntz R. Query processing for temporal databases. In: Proceedings of the 6th International Conference on Data Engineering; 1990. p. 200–8.
Leung TYC, Pirahesh H. Querying historical data in IBM DB2 C/S DBMS using recursive SQL. In: Clifford J, Tuzhilin A, editors. Recent advances in temporal databases. Berlin: Springer; 1995.
Lorentzos N, Johnson R. Extending relational algebra to manipulate temporal data. Inf Syst. 1988;15(3):289.
Lorentzos NA, Mitsopoulos YG. Sql extension for interval data. IEEE Trans Knowl Data Eng. 1997;9(3):480–99.
Sadeghi R, Samson WB, Deen SM. HQL – a historical query language. Technical report, Dundee College of Technology, Dundee, September 1987.
Snodgrass RT. The temporal query language TQuel. ACM Trans Database Syst. 1987;12(2):247–98.
Snodgrass RT, editor. The TSQL2 temporal query language. Boston: Kluwer; 1995.
Snodgrass RT. Developing time-oriented database applications in SQL. San Mateo: Morgan Kaufmann; 2000.
Tansel A, Clifford J, Gadia S, Jajodia S, Segev A, Snodgrass RT. 1Temporal databases: theory, design, and implementation. Redwood City: Benjamin/Cummings; 1993.
Zhou X, Wang F, Zaniolo C. Efficient temporal coalescing query support in relational database systems. In: Proceedings of the 17th International Conference Database and Expert System Applications; 2006. p. 676–86.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Böhlen, M.H. (2018). Temporal Coalescing. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_388
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_388
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering