Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Adaptive selectivity estimation using query feedback
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
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
Dynamic multidimensional histograms
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
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
Aggregate Processing of Planar Points
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
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
Overcoming Limitations of Sampling for Aggregation Queries
Proceedings of the 17th International Conference on Data Engineering
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Spatiotemporal Aggregate Computation: A Survey
IEEE Transactions on Knowledge and Data Engineering
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
An efficient algorithm for computing range-groupby queries
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Multi-dimensional aggregation for temporal data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Exploiting temporal correlation in temporal data warehouses
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Processing count queries over event streams at multiple time granularities
Information Sciences: an International Journal
Parsimonious temporal aggregation
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the VLDB Endowment
| Hi-index | 0.02 |
Temporal aggregate queries retrieve summarizedinformation about records with time-evolving attributes.Existing approaches have at least one of the followingshortcomings: (i) they incur large space requirements, (ii)they have high processing cost and (iii) they are based oncomplex structures, which are not available in commercialsystems. In this paper we solve these problems byapproximation techniques with bounded error. Wepropose two methods: the first one is based on multi-versionB-trees and has logarithmic worst-case query cost,while the second technique uses off-the-shelf B- and R-trees,and achieves the same performance in the expectedcase. We experimentally demonstrate that the proposedmethods consume an order of magnitude less space thantheir competitors and are significantly faster, even forcases that the permissible error bound is very small.