Indexing values of time sequences
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Efficient computation of temporal aggregates with range predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adaptable query optimization and evaluation in temporal middleware
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient integration and aggregation of historical information
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Foundation for Conventional and Temporal Query Optimization Addressing Duplicates and Ordering
IEEE Transactions on Knowledge and Data Engineering
Temporal and spatio-temporal aggregations over data streams using multiple time granularities
Information Systems - Special issue: Best papers from EDBT 2002
Temporal Aggregation over Data Streams Using Multiple Granularities
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Aggregate Processing of Planar Points
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Computational Indexes for Time Series
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Effective Temporal Aggregation Using Point-Based Trees
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Efficient Algorithms for Large-Scale Temporal Aggregation
IEEE Transactions on Knowledge and Data Engineering
Handbook of massive data sets
Incremental computation and maintenance of temporal aggregates
The VLDB Journal — The International Journal on Very Large Data Bases
Main Memory-Based Algorithms for Efficient Parallel Aggregation for Temporal Databases
Distributed and Parallel Databases
Spatiotemporal Aggregate Computation: A Survey
IEEE Transactions on Knowledge and Data Engineering
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
An efficient method for temporal aggregation with range-condition attributes
Information Sciences—Informatics and Computer Science: An International Journal
Artificial Intelligence in Medicine
On computing temporal aggregates with range predicates
ACM Transactions on Database Systems (TODS)
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Sequenced spatio-temporal aggregation in road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Parsimonious temporal aggregation
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Sequenced spatiotemporal aggregation for coarse query granularities
The VLDB Journal — The International Journal on Very Large Data Bases
Multi-dimensional aggregation for temporal data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Temporal aggregation on user-defined granularities
Journal of Intelligent Information Systems
Parsimonious temporal aggregation
The VLDB Journal — The International Journal on Very Large Data Bases
Timeline index: a unified data structure for processing queries on temporal data in SAP HANA
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Storing and processing temporal data in a main memory column store
Proceedings of the VLDB Endowment
Supporting historic queries in sensor networks with flash storage
Information Systems
| Hi-index | 0.00 |
Aggregate computation, such as selecting the minimum attribute value of a relation, is expensive, especially in a temporal database. We describe the basic techniques behind computing aggregates in conventional databases and show that these techniques are not efficient when applied to temporal databases. We examine the problem of computing constant intervals (intervals of time for which the aggregate value is constant) used for temporal grouping. We introduce two new algorithms for computing temporal aggregates: the aggregation tree and the k-ordered aggregation tree. An empirical comparison demonstrates that the choice of algorithm depends in part on the amount of memory available, the number of tuples in the underlying relation, and the degree to which the tuples are ordered. This study shows that the simplest strategy is to first sort the underlying relation, then apply the k-ordered aggregation tree algorithm with k=1.