Return to the homepage
Search the complete Wavelet Digest database
Help about the Wavelet Digest mailing list
About the Wavelet Digest
The Wavelet Digest
> Volume 11, Issue 1
Preprint: WaveletBased Relative Prefix Sum Methods for Range Sum Queries in Data Cubes

Previous :: Next

Author 
Message 
Daniel Lemire (lemire@ondelette.com) Guest

Posted: Thu Aug 15, 2002 11:24 am Subject: Preprint: WaveletBased Relative Prefix Sum Methods for Range Sum Queries in Data Cubes 



Title
WaveletBased Relative Prefix Sum Methods for Range Sum Queries in Data Cubes
Abstract
Data mining and related applications often rely on extensive range sum queries and thus, it is important for these queries to scale well. Range sum queries in data cubes can be achieved in time O(1) using prefix sum aggregates but prefix sum update costs are proportional to the size of the data cube O(n^d). Using the Relative Prefix Sum (RPS) method, the update costs can be reduced to the root of the size of the data cube O(n^d/2). We present a new family of base b wavelet algorithms further reducing the update costs to O(n^d/B) for B as large as we want while preserving constanttime queries. We also show that this approach leads to O(log^d n) query and update methods twice as fast as Haarbased methods. Moreover, since these new methods are pyramidal, they provide incrementally improving estimates.
Keywords
Badic wavelets, multidimensional databases, knowledge discovery.
Reference
Daniel Lemire, WaveletBased Relative Prefix Sum Methods for Range Sum Queries
in Data Cubes. Proceedings of CASCON 2002, Toronto, Canada, October 2002.
URL
http://www.ondelette.com/lemire/abstracts/CASCON2002.html 





All times are GMT + 1 Hour

Page 1 of 1 
