Efficient computation of temporal aggregates with range predicates

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 237-245

  Zhang, D ^a   Markowetz, A ^a   Tsotras, V ^a   Gunopulos, D ^a   Seeger, B ^a  

^a University of California Riverside   (United States)

Author keywords

Indexing; Range predicates; Temporal aggregates

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA WAREHOUSES; INDEXING (OF INFORMATION); PROBLEM SOLVING; TREES (MATHEMATICS);

TEMPORAL AGGREGATES;

QUERY LANGUAGES;

EID: 0034819727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.375600     Document Type: Conference Paper

References (18)

1. A unified approach for indexed and non-indexed spatial joins
2. An asymptotically optimal multiversion B-tree
3. The R* tree: An efficient and robust access method for points and rectangles
4. The dynamic data cube
5. Parallel algorithms for computing temporal aggregates
6. The consensus glossary of temporal database concepts - February 1998 version
7. Computing temporal aggregates
8. Designing access methods for bitemporal databases
9. Access methods for multiversion data
10. Scalable algorithms for large temporal aggregation
11. The representation of a temporal data model in the relational environment
12. Comparison of access methods for time-evolving data
13. Processing temporal aggregates in parallel
14. Incremental computation and maintenance of temporal aggregates
15. Efficient Computation of Temporal Aggregates with Range Predicates (full version)