Database Paper Browser

Back to papers

Efficient Computation of Temporal Aggregates with Range Predicates

Summary: Introduce the Multiversion SB-Tree, a novel index combining SB-Tree and Multiversion B-Tree ideas to efficiently support temporal SUM/COUNT/AVG over arbitrary key-range predicates, avoiding per-range indexes. Analysis and experiments show substantial performance gains. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1240
Venue
PODS
Year
2001
Pagerank
5.559394e-05
Overall Rank
5,340 | 62.89%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,828 Temporal Alignment 2012 SIGMOD 4.9088814e-05
8,577 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD 4.4879347e-05
12,653 Efficient Integration and Aggregation of Historical Information 2002 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016113151
683 Access Methods For Multiversion Data 1989 SIGMOD 0.00018162653
Previous Page 1 / 1 Next

Semantically Similar Papers