DBScholar

Back to papers

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)

Paper ID
he1516e0d846ee464
Venue
VLDB
Year
1996
Pagerank
7.220733e-05
Overall Rank
3,517 | 76.43%
DOI
-

Incoming Non-self Citations Over Time

Authors

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 9 of 9 citing papers.

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.00081781676
125 Predicate Migration: Optimizing Queries with Expensive Predicates 1993 SIGMOD 0.00030398363
220 An Evaluation of Non-Equijoin Algorithms 1991 VLDB 0.00024275691
2,033 Practical Predicate Placement 1994 SIGMOD 9.1389597e-05
5,523 Temporal Query Processing and Optimization in Multiprocessor Database Machines 1992 VLDB 6.0818572e-05
Previous Page 1 / 1 Next

Semantically Similar Papers