The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
Applied Numerical Methods for Engineers and Scientists
Applied Numerical Methods for Engineers and Scientists
ProPolyne: A Fast Wavelet-Based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Approximate query processing using wavelets
The VLDB Journal — The International Journal on Very Large Data Bases
Handbook of massive data sets
Wavelet-based relative prefix sum methods for range sum queries in data cubes
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Queue - Storage
Computing Moments by Prefix Sums
Computing Moments by Prefix Sums
Extended wavelets for multiple measures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A Portable Programming Interface for Performance Evaluation on Modern Processors
International Journal of High Performance Computing Applications
SHIFT-SPLIT: I/O efficient maintenance of wavelet-transformed multidimensional data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Pruning attribute values from data cubes with diamond dicing
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
| Hi-index | 0.00 |
For a massive I/O array of size n, we want to compute the first N local moments, for some constant N. Our simpler algorithms partition the array into consecutive ranges called bins, and apply not only to local-moment queries, but also to algebraic queries. With N buffers of size &sqrt;n, time complexity drops to O(&sqrt;n). A more sophisticated approach uses hierarchical buffering and has a logarithmic time complexity (O(b logb n)), when using N hierarchical buffers of size n/b. Using overlapped bin buffering, we show that only one buffer is needed, as with wavelet-based algorithms, but using much less storage.