Coalescing in Temporal Databases
Summary: Coalescing is a temporal unary operator; the paper shows how to prune semantically unnecessary coalescing. It surveys DBMS algorithms (nested-loop, sorting, partitioning) and SQL approaches, with a study showing feasibility but nontrivial cost. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael H. Böhlen (Aalborg University)
- 2. Richard T. Snodgrass (University of Arizona)
- 3. Michael D. Soo (University of South Florida)
BibTeX Citation
@article{bohlen_vldb96,
title = {{Coalescing in Temporal Databases}},
author = {Böhlen, Michael H. and Snodgrass, Richard T. and Soo, Michael D.},
journal = {PVLDB},
series = {{VLDB} '96},
pages = {180},
year = {1996}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,563 | Temporal Coalescing with Now, Granularity, and Incomplete Information | 2003 | SIGMOD | 6.5310739e-05 |
| 5,139 | Temporal Slicing in the Evaluation of XML Queries | 2003 | VLDB | 6.2555967e-05 |
| 6,500 | Capturing and Querying Multiple Aspects of Semistructured Data | 1999 | VLDB | 5.7626024e-05 |
| 6,799 | Snapshot Semantics for Temporal Multiset Relations | 2019 | VLDB | 5.6779871e-05 |
| 7,584 | Scalable Architecture and Query Optimization for Transaction-time DBs with Evolving Schemas | 2010 | SIGMOD | 5.4898986e-05 |
| 7,861 | TIP: A Temporal Extension to Informix | 2000 | SIGMOD | 5.4370952e-05 |
| 8,752 | LIT: Lightning-fast In-memory Temporal Indexing | 2024 | SIGMOD | 5.2857144e-05 |
| 9,070 | Preference-aware Integration of Temporal Data | 2015 | VLDB | 5.2263302e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7 | Implementation Techniques For Main Memory Database Systems | 1984 | SIGMOD | 0.00081971778 |
| 125 | Predicate Migration: Optimizing Queries with Expensive Predicates | 1993 | SIGMOD | 0.00030462671 |
| 220 | An Evaluation of Non-Equijoin Algorithms | 1991 | VLDB | 0.00024333068 |
| 2,035 | Practical Predicate Placement | 1994 | SIGMOD | 9.1519324e-05 |
| 5,540 | Temporal Query Processing and Optimization in Multiprocessor Database Machines | 1992 | VLDB | 6.0889837e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,458 | Temporal Relationships in Databases | 1988 | VLDB |
| 2 | 1,514 | Computing Joins Of Relations | 1975 | SIGMOD |
| 3 | 6,429 | Temporal Alignment | 2012 | SIGMOD |
| 4 | 821 | Query Execution Techniques for Caching Expensive Methods | 1996 | SIGMOD |
| 5 | 6,290 | On Spatially Partitioned Temporal Join | 1994 | VLDB |
| 6 | 13,391 | A Uniform Approach to Processing Temporal Queries | 1992 | VLDB |
| 7 | 5,540 | Temporal Query Processing and Optimization in Multiprocessor Database Machines | 1992 | VLDB |
| 8 | 7,616 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD |
| 9 | 4,064 | Event-Join Optimization in Temporal Relational Databases | 1989 | VLDB |
| 10 | 4,563 | Temporal Coalescing with Now, Granularity, and Incomplete Information | 2003 | SIGMOD |