Computational geometry: an introduction
Computational geometry: an introduction
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Efficient computation of temporal aggregates with range predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
Incremental Computation and Maintenance of Temporal Aggregates
Proceedings of the 17th International Conference on Data Engineering
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Parallel Algorithms for Computing Temporal Aggregates
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Scalable Algorithms for Large Temporal Aggregation
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Incremental computation and maintenance of temporal aggregates
The VLDB Journal — The International Journal on Very Large Data Bases
Approximate Temporal Aggregation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Main Memory-Based Algorithms for Efficient Parallel Aggregation for Temporal Databases
Distributed and Parallel Databases
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
An efficient method for temporal aggregation with range-condition attributes
Information Sciences—Informatics and Computer Science: An International Journal
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
Logging every footstep: quantile summaries for the entire history
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Online pattern aggregation over RFID data streams
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Aspect-oriented relational algebra
Proceedings of the 14th International Conference on Extending Database Technology
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sequenced spatiotemporal aggregation for coarse query granularities
The VLDB Journal — The International Journal on Very Large Data Bases
Rectangle-efficient aggregation in spatial data streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Proceedings of the VLDB Endowment
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
Comprehensive and interactive temporal query processing with SAP HANA
Proceedings of the VLDB Endowment
Supporting historic queries in sensor networks with flash storage
Information Systems
Hi-index | 0.00 |
Computing temporal aggregates is an important but costly operation for applications that maintain time-evolving data (data warehouses, temporal databases, etc.) Due to the large volume of such data, performance improvements for temporal aggregate queries are critical. Previous approaches have aggregate predicates that involve only the time dimension. In this article we examine techniques to compute temporal aggregates that include key-range predicates as well (range-temporal aggregates). In particular we concentrate on the SUM aggregate, while COUNT is a special case. To handle arbitrary key ranges, previous methods would need to keep a separate index for every possible key range. We propose an approach based on a new index structure called the Multiversion SB-Tree, which incorporates features from both the SB-Tree and the Multiversion B+--tree, to handle arbitrary key-range temporal aggregate queries. We analyze the performance of our approach and present experimental results that show its efficiency. Furthermore, we address a novel and practical variation called functional range-temporal aggregates. Here, the value of any record is a function over time. The meaning of aggregates is altered such that the contribution of a record to the aggregate result is proportional to the size of the intersection between the record's time interval and the query time interval. Both analytical and experimental results show the efficiency of our result.