DBScholar

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
1239
Venue
PODS
Year
2001
Pagerank
6.1968336e-05
Overall Rank
5,501 | 62.26%
DOI
10.1145/375551.375600

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_pods01,
        address = {New York, NY, USA},
        series = {{PODS} '01},
        title = {{Efficient Computation of Temporal Aggregates with Range Predicates}},
        url = {https://dl.acm.org/doi/10.1145/375551.375600},
        doi = {10.1145/375551.375600},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Zhang, Donghui and Markowetz, Alexander and Tsotras, Vassilis and Gunopulos, Dimitrios and Seeger, Bernhard},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,805 Temporal Alignment 2012 SIGMOD 5.7678408e-05
8,575 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD 5.4095946e-05
12,837 Efficient Integration and Aggregation of Historical Information 2002 SIGMOD 5.093636e-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
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
681 Access Methods For Multiversion Data 1989 SIGMOD 0.0001502579
Previous Page 1 / 1 Next

Semantically Similar Papers